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

116题为完美二叉树，所以这题116的递归法这里不适用。
leetcode 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 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;        
    }
};