LeetCode OJ:Populating Next Right Pointers in Each Node II

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

算法思想：根据层序遍历的思想，将每一层元素链接起来，用curLev变量表示访问到当前层的第几个元素了，nextLev表示下一层多少个元素，然后用辅助结构体指针将这一层的节点相连;

/**
 * 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)return;
        queue<TreeLinkNode *>que;
        TreeLinkNode *p;
        p=NULL;
        int minLen=0;
		int curLev=1;
		int nextLev=0;
        que.push(root);
        while(!que.empty()){
            TreeLinkNode *cur=que.front();
            que.pop();
            if(p==NULL)p=cur;
            else {p->next=cur;p=cur;}
            if(cur->left){que.push(cur->left);nextLev++;}
            if(cur->right){que.push(cur->right);nextLev++;}
            if(--curLev==0){
				p->next=NULL;
                p=NULL;
				curLev=nextLev;
				nextLev=0;
			}
        }
    }
};

迭代版2：

时间复杂度O(n)，空间复杂度O(1)

/**
 * 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) {
        while(root){
            TreeLinkNode *next=NULL;
            TreeLinkNode *prev=NULL;
            for(;root;root=root->next){
                if(!next)next=root->left?root->left:root->right;
                
                if(root->left){
                    if(prev)prev->next=root->left;
                    prev=root->left;
                }
                if(root->right){
                    if(prev)prev->next=root->right;
                    prev=root->right;
                }
            }
            root=next;
        }
    }
};

递归版

时间复杂度O(n)，空间复杂度O(1)

/**
 * 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(NULL == root)return;
        
        TreeLinkNode dummy(-1);
        TreeLinkNode *cur=root,*prev=&dummy;
        for(;cur;cur=cur->next){
            if(cur->left){
                prev->next=cur->left;
                prev=prev->next;
            }
            if(cur->right){
                prev->next=cur->right;
                prev=prev->next;
            }
        }
        connect(dummy.next);
    }
};