标签：
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:
注意是完全二叉树！！！！我没有看Note想了半天没想好怎么求。。。。
1 /** 2 * Definition for binary tree with next pointer. 3 * struct TreeLinkNode { 4 * int val; 5 * TreeLinkNode *left, *right, *next; 6 * TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {} 7 * }; 8 */ 9 class Solution { 10 public: 11 void connect(TreeLinkNode *root) { 12 if(root == NULL) 13 return ; 14 if(root->right!=NULL){ 15 root->left->next=root->right; 16 if(root->next!=NULL){ 17 root->right->next=root->next->left; 18 } 19 } 20 connect(root->left); 21 connect(root->right); 22 23 } 24 };
[Leetcode]Populating Next Right Pointers in Each Node
标签：
原文地址：http://www.cnblogs.com/desp/p/4338584.html
