LeetCode 117. Populating Next Right Pointers in Each Node II

原题链接在这里：https://leetcode.com/problems/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: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":null,"right":null,"val":4},"next":null,"right":{"$id":"4","left":null,"next":null,"right":null,"val":5},"val":2},"next":null,"right":{"$id":"5","left":null,"next":null,"right":{"$id":"6","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}

Output: {"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":null,"right":null,"val":7},"right":null,"val":5},"right":null,"val":4},"next":{"$id":"6","left":null,"next":null,"right":{"$ref":"5"},"val":3},"right":{"$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.

题解：

是Populating Next Right Pointers in Each Node的进阶版. 

Iteration解法相同.

Time Complexity: O(n). Space: O(1).

AC Java:

/*
// 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) {
        Node cur = root;
        while(cur != null){
            Node dummyHead = new Node(); //记录下一层的假头
            Node it = dummyHead;
            
            while(cur != null){
                if(cur.left != null){
                    it.next = cur.left;
                    it = it.next;
                }
                
                if(cur.right != null){
                    it.next = cur.right;
                    it = it.next;
                }
                
                cur = cur.next;  //cur 更新到下一层假头的next上面
            }
            
            cur = dummyHead.next;
        }
        
        return root;
    }
}