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

解法一：递归法

自顶而下，将所有根节点最内侧子节点连接上。

/*
// 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 NULL;
        Node* l=root->left;
        Node* r=root->right;
        while(l){
            l->next=r;
            l=l->right;
            r=r->left;
        }
        connect(root->left);
        connect(root->right);
        return root;
    }
};

方法二：层次遍历

从左到右，需要处理最右边。

class Solution {
public:
    Node* connect(Node* root) {
        if(!root)
            return root;
        queue<Node*> q;
        q.push(root);
        while(!q.empty()){
            int length=q.size();
            for(int i=0;i<length;i++){
                Node* cur=q.front();
                q.pop();              
                if(cur->left)	//先放左节点在右结点
                    q.push(cur->left);
                if(cur->right)
                    q.push(cur->right);
                if(i==length-1) //最右边的next为NULL
                    cur->next=NULL;
                else
                    cur->next=q.front();           
            }
        }
        return root;        
    }
};

从右到左，更简洁。

class Solution {
public:
    Node* connect(Node* root) {
        if(!root)
            return root;
        queue<Node*> q;
        q.push(root);
        while(!q.empty()){
            int length=q.size();
            Node* next=NULL;
            for(int i=0;i<length;i++){
                Node* cur=q.front();
                q.pop();  
                if(cur->right)     //先放右节点再左节点
                    q.push(cur->right);            
                if(cur->left)
                    q.push(cur->left);               
                cur->next=next;
                next=cur;         
            }
        }
        return root;        
    }
};