# 题目：Given a binary tree

    struct TreeLinkNode {
}


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:

• You may only use constant extra space.
• You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

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

# 代码：

/**
* Definition for binary tree with next pointer.
* struct TreeLinkNode {
*  int val;
*  TreeLinkNode *left, *right, *next;
*  TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
public:
/*
void connect(TreeLinkNode *root) {
if(root==NULL)  return ;
if(root->left&&root->right){
root->left->next=root->right;
}
if(root->next&&root->left){//到了非根节点的时候
root->right->next=root->next->left;
}

connect(root->left);connect(root->right);
}
*/
if(root==NULL)  return ;

while(root&&root->left){
while(root){
root->left->next=root->right;
if(root->next){
root->right->next=root->next->left;
}
root=root->next;
}
root=tmp;
}
}
};

• 本文已收录于以下专栏：

举报原因： 您举报文章：Populating Next Right Pointers in Each Node 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)