LeetCode- populating-next-right-pointers-in-each-node-ii

最新推荐文章于 2019-08-20 23:29:10 发布

六月二十七

最新推荐文章于 2019-08-20 23:29:10 发布

阅读量112

点赞数

分类专栏： LeetCode 文章标签： populating-next-right-pointers LeetCode

本文链接：https://blog.csdn.net/weixin_42146769/article/details/88959800

版权

LeetCode 专栏收录该内容

105 篇文章 0 订阅

订阅专栏

Follow up for problem "Populating Next Right Pointers in Each Node".

What if the given tree could be any binary tree? Would your previous solution still work?

Note:

You may only use constant extra space.

For example,
Given the following binary tree,

         1
       /  \
      2    3
     / \    \
    4   5    7
After calling your function, the tree should look like:

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

/**
 * Definition for binary tree with next pointer.
 * public class TreeLinkNode {
 *     int val;
 *     TreeLinkNode left, right, next;
 *     TreeLinkNode(int x) { val = x; }
 * }
 */
public class Solution {
    public void connect(TreeLinkNode root) {
        if(root == null){
            return;
        }
        TreeLinkNode dummy = new TreeLinkNode(-1);
        TreeLinkNode cur;
        TreeLinkNode prev = dummy;
        for(cur=root; cur !=null; cur = cur.next){
            if(cur.left !=null)
            {
                prev.next = cur.left;
                prev = prev.next;
            }
            if(cur.right !=null){
                prev.next = cur.right;
                prev = prev.next;
            }
        }
        connect(dummy.next);
    }
}