(1)层次遍历
/*
// 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 nullptr;
queue<Node*> q;
q.push(root);
Node *prev=nullptr,*cur=nullptr;
int n=0;
while(!q.empty()) {
n=q.size();
for(int i=0;i<n;i++) {
cur=q.front();
q.pop();
if(cur->left) q.push(cur->left);
if(cur->right) q.push(cur->right);
if(i!=0) prev->next=cur;
prev=cur;
}
}
return root;
}
};