leecode-116-填充每个节点的下一个右侧节点指针

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

    public Node() {}
    
    public Node(int _val) {
        val = _val;
    }

    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 null;
        connectTwoNode(root.left, root.right);
        return root;
    }
    //辅助函数
    public void connectTwoNode(Node node1, Node node2) {
        if (node1 == null || node2 == null) {
        return;
        }
		// 连接两个节点
        node1.next = node2;
		// 连接相同父节点的两个子节点
        connectTwoNode(node1.left, node1.right);
        connectTwoNode(node2.left, node2.right);
		// 连接不同父节点的两个子节点
        connectTwoNode(node1.right, node2.left);
    }
}