[leetcode]117. Populating Next Right Pointers in Each Node II@Java解题报告

https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/description/

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

package go.jacob.day809;

/**
 * 117. Populating Next Right Pointers in Each Node II
 * 
 * @author Jacob
 *
 */
public class Demo2 {
	public void connect(TreeLinkNode root) {
		while (root != null) {
			//tmpLevelFirst为新建立的每层第一个节点（为了方便后面遍历当前行节点）
			TreeLinkNode tmpLevelFirst = new TreeLinkNode(0);
			TreeLinkNode cur = tmpLevelFirst;
			while (root != null) {
				if (root.left != null) {
					cur.next = root.left;
					cur = cur.next;
				}
				if (root.right != null) {
					cur.next = root.right;
					cur = cur.next;
				}
				root = root.next;
			}
			root = tmpLevelFirst.next;
		}
	}
}