Leetcode-populating-next-right-pointers-in-each-node-ii ***

题目描述

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

这一题和前面一篇博文类似，升级版，这一题没有说明二叉树是完全二叉树。

下面是解题代码：

 * 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);
    }
}

同时这个代码也可以解决上一篇博文的问题！！！double kill~