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
和问题I的解法一样~
/**
* 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;
}
queue<pair<TreeLinkNode*,int> > levelQueue;
pair<TreeLinkNode*,int>* tmp;
TreeLinkNode *prev=root;
int currLevel=0;
levelQueue.push(make_pair(root,currLevel+1));
while(!levelQueue.empty()){
tmp=&levelQueue.front();
levelQueue.pop();
if(tmp->second!=currLevel){
prev->next=NULL;
currLevel=tmp->second;
}else{
prev->next=tmp->first;
}
prev=tmp->first;
if(tmp->first->left){
levelQueue.push(make_pair(tmp->first->left,tmp->second+1));
}
if(tmp->first->right){
levelQueue.push(make_pair(tmp->first->right,tmp->second+1));
}
}
}
};