[leetcode] 117. Populating Next Right Pointers in Each Node II

Description

Given a binary tree

struct Node {
int val;
Node *left;
Node *right;
Node *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.

Example:

Input: {“KaTeX parse error: Expected '}', got 'EOF' at end of input: …":"1","left":{"id”:“2”,“left”:{“KaTeX parse error: Expected 'EOF', got '}' at position 53: …t":null,"val":4}̲,"next":null,"r…id”:“4”,“left”:null,“next”:null,“right”:null,“val”:5},“val”:2},“next”:null,“right”:{“KaTeX parse error: Expected '}', got 'EOF' at end of input: …null,"right":{"id”:“6”,“left”:null,“next”:null,“right”:null,“val”:7},“val”:3},“val”:1}

Output: {“KaTeX parse error: Expected '}', got 'EOF' at end of input: …":"1","left":{"id”:“2”,“left”:{“KaTeX parse error: Expected '}', got 'EOF' at end of input: …:null,"next":{"id”:“4”,“left”:null,“next”:{“KaTeX parse error: Expected 'EOF', got '}' at position 53: …t":null,"val":7}̲,"right":null,"…id”:“6”,“left”:null,“next”:null,“right”:{“KaTeX parse error: Expected 'EOF', got '}' at position 9: ref":"5"}̲,"val":3},"righ…ref”:“4”},“val”:2},“next”:null,“right”:{"$ref":“6”},“val”:1}

Explanation: Given the above binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B.

Note:

You may only use constant extra space.
Recursive approach is fine, implicit stack space does not count as extra space for this problem.

Analysis

本题与116的区别在于，本题中的树不保证是完全二叉树，即节点有可能缺失左孩子或右孩子。且本题要求用constant space，而传统递归/非递归方法的都与n相关，非常量。因此只能用下面方法。
设置dummy和cur两个指针，dummy是创建出的一个新节点，用于记录每层的最左节点，便于root指针在指向下一层时可以识别。cur用于遍历该层所有节点，并连接下一层的next指针。要注意在遍历完每一层时，须将dummy指向空，否则当root为最左的叶子节点且next指向空时，root将一直指向root自己（因为dummy->next指向root），陷入死循环。
本题思路参考：https://www.cnblogs.com/grandyang/p/4290148.html

Code

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* left;
    Node* right;
    Node* next;

    Node() {}

    Node(int _val, Node* _left, Node* _right, Node* _next) {
        val = _val;
        left = _left;
        right = _right;
        next = _next;
    }
};
*/
class Solution {
public:
    Node* connect(Node* root) {
        Node* dummy = new Node(0, NULL, NULL, NULL);
        Node* cur = dummy;
        Node* head = root;
        
        while(root){
            if(root->left){
                cur->next = root->left;
                cur = cur->next;
            }
            if(root->right){
                cur->next = root->right;
                cur = cur->next;
            }
            root = root->next;
            if(!root){
                cur = dummy;
                root = dummy->next;
                dummy->next = NULL;
            }
        }
        
        return head;
    }
};