Tree——No.116 Populating Next Right Pointers in Each Node

Problem：

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

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.

Explanation：

将每个结点的next指向它右边的结点。

My Thinking：

层序遍历，然后改变指针

My Solution：

class Solution {
    public Node connect(Node root) {
        if(root==null)
            return root;
        Queue<Node> queue=new LinkedList<>();
        queue.add(root);
        
        while(!queue.isEmpty()){
            int length=queue.size();
            Node node1=new Node();
            for(int i=0;i<length;i++){
                Node node2=queue.poll();
                if(node2.left!=null)
                    queue.add(node2.left);
                if(node2.right!=null)
                    queue.add(node2.right);
                node1.next=node2;
                node1=node2;
            }
            node1.next=null;
        }
        return root;
    }
}

Optimum Thinking:

只需要将当前结点的左孩子的next指向右孩子，右孩子的next指向上一个结点的左孩子即可。

Optimum Solution：

（1）

class Solution {
    public Node connect(Node root) {
        if(root==null)
            return root;
        Node pre=root;
        Node cur=null;
        while(pre.left!=null){
            cur=pre;
            while(cur!=null){
                cur.left.next=cur.right;
                if(cur.next!=null)
                    cur.right.next = cur.next.left;
                cur = cur.next;
            }
            pre=pre.left;
        }
        return root;
    }
}

（2）

class Solution {
    public Node connect(Node root) {
        if(root == null)
            return root;
        
        if(root.left != null){
            root.left.next = root.right;
            if(root.next != null)
                root.right.next = root.next.left;
        }

        connect(root.left);
        connect(root.right);
        return root;
    }
}