[LeetCode]Populating Next Right Pointers in Each Node

最新推荐文章于 2020-05-02 11:51:10 发布

原创最新推荐文章于 2020-05-02 11:51:10 发布 · 711 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

102 篇文章

订阅专栏

本文介绍两种填充二叉树next指针的方法：递归法与队列法。递归法通过调整左右子节点的next指针来实现；队列法则利用完全二叉树特性，按层遍历并设置next指针。

题目描述

Given a binary tree

    struct TreeLinkNode {
      TreeLinkNode *left;
      TreeLinkNode *right;
      TreeLinkNode *next;
    }

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Note:

You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

For example,
Given the following perfect binary tree,

After calling your function, the tree should look like:

         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \  / \
    4->5->6->7 -> NULL

解题思路

思路一：

递归

if (root.right != null && root.next != null) {
right.next = root.next.left;
}

思路二：

因为是完全二叉树，所以使用变量记录当前层的节点个数，利用队列按层遍历即可。

代码

思路一：

/**
	 * Given the following perfect binary tree,
          1
        /  \
       2    3
      / \  / \
     4  5  6  7
     After calling the function, the tree should look like:

          1 -> NULL
        /  \
       2 -> 3 -> NULL
      / \  / \
     4->5->6->7 -> NULL
	 * @param root
	 */
	public void connect(TreeLinkNode root) {
		if (root == null)
			return;

		TreeLinkNode left = root.left;
		TreeLinkNode right = root.right;

		if (left != null) {
			left.next = right;
		}

		if (right != null && root.next != null) {
			right.next = root.next.left;
		}

		connect(left);
		connect(right);
	}

	public class TreeLinkNode {
		int val;
		TreeLinkNode left, right, next;

		TreeLinkNode(int x) {
			val = x;
		}
	}

思路二：

	/**
	 * Given the following perfect binary tree,
          1
        /  \
       2    3
      / \  / \
     4  5  6  7
     After calling the function, the tree should look like:

          1 -> NULL
        /  \
       2 -> 3 -> NULL
      / \  / \
     4->5->6->7 -> NULL
	 * @param root
	 */
	public void connect(TreeLinkNode root) {
		if (root == null)
			return;

		Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode>();
		TreeLinkNode node = null;
		TreeLinkNode lastNode = null;
		int currentLevelCount = 1;//记录当前层的节点个数
		int level = 0;//记录层数
		queue.offer(root);

		while (!queue.isEmpty()) {
			node = queue.poll();

			currentLevelCount--;

			if (lastNode != null) {
				lastNode.next = node;
			}
			if (node.left != null && node.right != null) {
				queue.add(node.left);
				queue.add(node.right);
			}
			
			lastNode = node;
			
			//node是当前层的最后一个节点
			if (currentLevelCount == 0) {
				node.next = null;
				level++;
				currentLevelCount = 1 << level;
				lastNode = null;
			}
		}
	}
	
	public class TreeLinkNode {
		int val;
		TreeLinkNode left, right, next;

		TreeLinkNode(int x) {
			val = x;
		}
	}