leetcode#116 Populating Next Right Pointers in Each Node

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.

Follow up:

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

Example 1:

Input: root = [1,2,3,4,5,6,7]
Output: [1,#,2,3,#,4,5,6,7,#]
Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with ‘#’ signifying the end of each level.

Constraints:

The number of nodes in the given tree is less than 4096.
-1000 <= node.val <= 1000

思路
运用递归
如果根节点为空返回null如果根节点的左节点不为空 根节点的左节点的next 为右节点

如果根节点的next不为空 根节点的右节点不为空 右节点的next 为 root。next。left
然后递归循环左右节点，最后返回root

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