LeetCode_Populating Next Right Pointers in Each Node II

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

  

复制代码
/**
 * 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
        while(root){
            TreeLinkNode *head = NULL;
            TreeLinkNode *pre  = NULL;
            for(;root;root = root->next){
                if(!head) head = root->left ? root->left : root->right;
                
                if(root->left){
                    if(pre)pre->next = root->left;
                    pre = root->left;
                }
                
                if(root->right){
                    if(pre) pre->next = root->right;
                    pre = root->right;
                }
            }// end of for    
            root = head;
        } // end of while 
    }
};
复制代码

 

posted @   冰点猎手  阅读(197)  评论(0编辑  收藏  举报
努力加载评论中...
点击右上角即可分享
微信分享提示