简单递归+层序遍历（记录层数） 116. 填充每个节点的下一个右侧节点指针 117. 填充每个节点的下一个右侧节点指针 II

递归实现填充节点

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

    Node() : val(0), left(NULL), right(NULL), next(NULL) {}

    Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}

    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) return root;
        root->next=NULL;
        getnext(root->left,root->right);
        return root;
    }
private:
    void getnext(Node* a,Node * b){
   
        if(!a||!b) return;
        a->next=b;
        getnext(a->left,a->right);
        getnext(a->right,b->left);
        getnext(b->left,b->right);
        return;
    }