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
用递归,这样算是 Constant Space 吗?
/** * 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) { // Start typing your C/C++ solution below // DO NOT write int main() function if(root==NULL) return; TreeLinkNode* p = root; TreeLinkNode* q = NULL; TreeLinkNode* nextLevel = NULL; while(p) { if(p->left) { if(q) { q->next = p->left; } q = p->left; if(nextLevel==NULL) { nextLevel = p->left; } } if(p->right) { if(q) { q->next = p->right; } q = p->right; if(nextLevel==NULL) { nextLevel = p->right; } } p = p->next; } connect(nextLevel); } };