Leetcode | Populating Next Right Pointers in Each Node I & II

Populating Next Right Pointers in Each Node I

Given a binary tree

struct TreeLinkNode {
TreeLinkNode *left;
TreeLinkNode *right;
TreeLinkNode *next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Note:

You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1
/
2 3
/ /
4 5 6 7
After calling your function, the tree should look like:
1 -> NULL
/
2 -> 3 -> NULL
/ /
4->5->6->7 -> NULL

Method I

这里我用了bfs的方法，或者叫层次遍历。

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if (root == NULL) {
            return;
        }
        queue<TreeLinkNode*> q;
        TreeLinkNode* p, *endOfLayer;
        q.push(root);
        endOfLayer = root;
        
        while (!q.empty()) {
            p = q.front();
            q.pop();
            
            if (p->left) q.push(p->left);
            if (p->right) q.push(p->right);
            if (p == endOfLayer) {
                p->next = NULL; 
                endOfLayer = q.back();
            } else {
                p->next = q.front();
            }
        }
    }
};

Method II

网上的另一种方法是是利用了next这个指针。访问第k层时把k+1层的next指针设置好。每一层的开头用一个front指针表示，当前层当前结点用cur表示，下一层的前置结点用next表示。注意next为空时，表明是下一层的第一个结点，要特殊处理。 

因为是pefect binary tree，所以进入到下一层就是front = front->left;

这种方法的好处是仍然是层次遍历的思想，但是没有用到queue，用O(1)的空间。

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if (root == NULL) {
            return;
        }
        
        TreeLinkNode *cur, *front, *next;
        front = cur = root;
        next = NULL;
        
        while (front != NULL) {
            if (cur->left != NULL) {
                if (next == NULL) {
                    next = cur->left;
                } else {
                    next->next = cur->left;
                    next = next->next;
                }
            }
            if (cur->right != NULL) {
                if (next == NULL) {
                    next = cur->right;
                } else {
                    next->next = cur->right;
                    next = next->next;
                }
            }
            cur = cur->next;
            if (cur == NULL) {
                front = front->left;
                cur = front;
                next = NULL;
            }
        }
    }
};

Method III

当然用递归也是可以的。也很直观。

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if (root == NULL) {
            return;
        }
        
        if (root->left) {
            root->left->next = root->right;
        }
        if (root->right && root->next) {
            root->right->next = root->next->left;
        }
        connect(root->left);
        connect(root->right);
    }
};

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.

既然是要求O(1)空间，那么用queue（Method I）和递归（Method III）都不行了。

因为这里是任意的binary tree，所以要维护下一层的头指针。cur为空时会指下下一层的头指针，如果此时为空就退出。所以循环条件改为cur != NULL。

class Solution {
public:
    void connect(TreeLinkNode *root) {
        if (root == NULL) {
            return;
        }
        
        TreeLinkNode *cur, *nextFront, *next;
        cur = root;
        nextFront = next = NULL;
        
        while (cur != NULL) {
            if (cur->left != NULL) {
                if (next == NULL) {
                    nextFront = next = cur->left;
                } else {
                    next->next = cur->left;
                    next = next->next;
                }
            }
            if (cur->right != NULL) {
                if (next == NULL) {
                    nextFront = next = cur->right;
                } else {
                    next->next = cur->right;
                    next = next->next;
                }
            }
            cur = cur->next;
            if (cur == NULL) {
                cur = nextFront;
                nextFront = next = NULL;
            }
        }
    }
};

 第三次刷的时候，代码简洁许多了。

void connect(TreeLinkNode *root) {
        TreeLinkNode h(0), *p = root, *next;
        
        while (p) {
            next = &h;
            h.next = NULL;
            for (; p; p = p->next) {
                if (p->left) {
                    next->next = p->left;
                    next = next->next;
                } 
                if (p->right) {
                    next->next = p->right;
                    next = next->next;
                }
            }
            p = h.next;
        }
    }

I和II的代码是一致的。