标签：style blog color io ar strong for div sp
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:
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
1 /** 2 * Definition for binary tree with next pointer. 3 * public class TreeLinkNode { 4 * int val; 5 * TreeLinkNode left, right, next; 6 * TreeLinkNode(int x) { val = x; } 7 * } 8 */ 9 public class Solution { 10 public void connect(TreeLinkNode root) { 11 if (root==null) { 12 return; 13 } 14 TreeLinkNode father=null; 15 root.next=null; 16 doConnect(root, father); 17 18 } 19 20 private void doConnect(TreeLinkNode root,TreeLinkNode father){ 21 if (root == null) { 22 return; 23 } 24 TreeLinkNode left=root.left; 25 TreeLinkNode right=root.right; 26 if (root.left != null) { 27 left.next=right; 28 if (father !=null) { 29 if ((father.next !=null) &&(father.next.left!=null)) { 30 right.next=father.next.left; 31 } 32 33 } 34 doConnect(left, left); 35 doConnect(right, right); 36 37 } 38 39 } 40 }
LeetCode Populating Next Right Pointers in Each Node
标签：style blog color io ar strong for div sp
原文地址：http://www.cnblogs.com/birdhack/p/3983560.html
