Populating Next Right Pointers in Each Node

最新推荐文章于 2022-02-25 23:41:44 发布

千寻221

最新推荐文章于 2022-02-25 23:41:44 发布

阅读量429

点赞数

分类专栏： LeetCode 文章标签： LeetCode 树 Java

本文链接：https://blog.csdn.net/u010378705/article/details/28292391

版权

LeetCode 专栏收录该内容

150 篇文章 0 订阅

订阅专栏

题目

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,
         1
       /  \
      2    3
     / \  / \
    4  5  6  7
After calling your function, the tree should look like:
         1 -> NULL
       /  \
      2 -> 3 -> NULL
     / \  / \
    4->5->6->7 -> NULL

方法一

该题目与树的层次遍历很类似，因此可以采用树的层次遍历来解决，可以使用队列。

由于树是满二叉树，每一层的结点的数量是固定的，可以用于结束每一层的遍历。

    public void connect(TreeLinkNode root) {
        if (root != null) {
        	if (!(root.left == null && root.right == null)) {
        		Queue<TreeLinkNode> queue = new LinkedList<TreeLinkNode>();
        		queue.offer(root.left);
        		queue.offer(root.right);
        		int count = 1;
        		while(!queue.isEmpty()) {
        			count = count * 2;
        			TreeLinkNode pre = queue.poll();
        			if (pre.left != null) {
        				queue.offer(pre.left);
        			}
        			if (pre.left != null) {
        				queue.offer(pre.right);
        			}        			
        			for (int i = 1; i < count; i++) {
        				TreeLinkNode cur = queue.poll();
        				
        				if (cur.left != null) {
        					queue.offer(cur.left);
        				}
        				if (cur.right != null) {
        					queue.offer(cur.right);
        				}			
        				pre.next = cur;
        				pre = cur;
        			}
        		}
        	}
        }
    }

方法二

由于上一层next的指针已经初始化了，可以利用该指针，来进行连接下一层。

    public void connect(TreeLinkNode root) {
    	if (root != null) {
    		TreeLinkNode  node = root;
    		while (node != null && node.left != null && node.right != null) {
    			root = node;
    			while (root != null) {
    				root.left.next = root.right;
    				if (root.next != null) {
    					root.right.next = root.next.left;
    				}
    				root = root.next;
    			}
    			node = node.left;
    		}
    	}
    }