Problem 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:
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
1 public void connect(TreeLinkNode root) { 2 if (root == null) { 3 return; 4 } 5 6 TreeLinkNode cur = root.next; 7 TreeLinkNode p = null; 8 while (cur != null) { 9 if (cur.left != null) { 10 p = cur.left; 11 break; 12 } 13 if (cur.right != null) { 14 p = cur.right; 15 break; 16 } 17 cur = cur.next; 18 } 19 20 if (root.right != null) { 21 root.right.next = p; 22 } 23 if (root.left != null) { 24 root.left.next = root.right != null ? root.right : p; 25 } 26 27 connect(root.right); 28 connect(root.left); 29 }
Problem Populating Next Right Pointers in Each Node II,布布扣,bubuko.com
Problem Populating Next Right Pointers in Each Node II
原文：http://www.cnblogs.com/liew/p/3815144.html