Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
- You may only use constant extra space.
For example,
Given the following binary tree,
1 / \ 2 3 / \ \ 4 5 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ \ 4-> 5 -> 7 -> NULL
使用一个虚拟头结点来解决问题,代码量小了很多
class Solution {
public:
void connect(TreeLinkNode *root) {
dfs(root);
}
void dfs(TreeLinkNode* node){
if(node==NULL)
return;
TreeLinkNode* head = new TreeLinkNode(-1);
TreeLinkNode* tail = head;
while(node!=NULL){
if(node->left!=NULL){
tail->next = node->left;
tail = tail->next;
}
if(node->right!=NULL){
tail->next = node->right;
tail = tail->next;
}
node= node->next;
}
dfs(head->next);
}
};