LeetCode 117. Populating Next Right Pointers in Each Node II（二叉树）

Populating Next Right Pointers in Each Node II

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.

思路

LeetCode 116. Populating Next Right Pointers in Each Node的姊妹题，区别在于本题不保证二叉树是满的。思路改动主要有两点：

1. root.right.next = root.next.left 改为遍历找右侧的第一个非空节点
2. 递归调用时从右向左递归，因为左边节点递归方法的计算依赖完整的next路径

代码

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

    public Node() {}

    public Node(int _val,Node _left,Node _right,Node _next) {
        val = _val;
        left = _left;
        right = _right;
        next = _next;
    }
};
*/
class Solution {
    public Node connect(Node root) {
        if (root == null) 
            return root;  
  
        Node p = root.next;  
        while (p != null) {  
            if (p.left != null) {  
                p = p.left;  
                break;  
            }  
            if (p.right != null) {  
                p = p.right;  
                break;  
            }  
            p = p.next;  
        }  
  
        if (root.right != null) {  
            root.right.next = p;  
        }  
  
        if (root.left != null) {
            if(root.right!=null)
                root.left.next = root.right;
            else
                root.left.next = p;
        }  
  
        connect(root.right);            // 必须先右再左
        connect(root.left);
        return root;
    }
}