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 -> NULLanswer:
class Solution {
public:
void connect(TreeLinkNode *root) {
TreeLinkNode temp(0);
TreeLinkNode * index = &temp;
TreeLinkNode * pre = root, * end = root, * end2 = end;
index->next = root;
if(!root) return;
while(index != end){
index = index->next;
pre->next = NULL;
if(!index)
return;
end2->next = index->left;
end2 = end2->next;
if(!end2)
return;
end2->next = index->right;
end2 = end2->next;
if(!end2)
return;
if(index == end){
pre = end;
end = end2;
}
}
}
};