【leetcode/二叉树】填充每一个节点下一个节点的右侧指针（简单递归）

问题描述：

给定一个完美二叉树，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下：

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}

填充它的每个 next 指针，让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点，则将 next 指针设置为 NULL。

初始状态下，所有 next 指针都被设置为 NULL。

 

示例：

输入：{"$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":{"$id":"6","left":null,"next":null,"right":null,"val":6},"next":null,"right":{"$id":"7","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}

输出：{"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":{"$id":"6","left":null,"next":null,"right":null,"val":7},"right":null,"val":6},"right":null,"val":5},"right":null,"val":4},"next":{"$id":"7","left":{"$ref":"5"},"next":null,"right":{"$ref":"6"},"val":3},"right":{"$ref":"4"},"val":2},"next":null,"right":{"$ref":"7"},"val":1}

解释：给定二叉树如图 A 所示，你的函数应该填充它的每个 next 指针，以指向其下一个右侧节点，如图 B 所示。

基本思路：

1. 先确定大致思路，显然用递归。每一次递归的函数体内，得把两个节点用next关联，所以得用两个参数。
2. 递归的具体步骤就是把两个节点的下面四个节点（包括空节点）分成几组，然后递归即可。
3. 注意处理特殊的情况。

AC代码：

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

    Node() {}

    Node(int _val, Node* _left, Node* _right, Node* _next) {
        val = _val;
        left = _left;
        right = _right;
        next = _next;
    }
};
*/
class Solution {
public:
    void Connect(Node *p1, Node *p2) {
      if (!p1 && !p2) return;
      p1->next = p2;
      if (p1 && !p2) {
        Connect(p1->left, p1->right);
        Connect(p1->right, NULL);
        return;
      }
      Connect(p1->left, p1->right);
      Connect(p1->right, p2->left);
      Connect(p2->left, p2->right);
      Connect(p2->right, NULL);
    }
  
    Node* connect(Node* root) {
      if (!root) return NULL;
      Connect(root, NULL);
      return root;
    }
};