题目:
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:
- 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 || root->left == NULL) return ;
TreeLinkNode* opre = root, *pre, *cur;
while(opre->left){
pre = opre; cur = opre->left;
while(pre){//注意: 不要写成!pre 细心一点
cur->next = pre->right;
cur = cur->next;
if(pre->next){
cur->next = pre->next->left;
//pre = pre->next; 注意: 这个不能写在里面。
cur = cur->next;
}
pre = pre->next;
}
opre = opre->left;
}
}
};