思路:
直接层序遍历,
记录并从每层的最左节点开始,到最右的节点结束。
/*
// 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);
while(!q.empty()){
int n=q.size();//每层的n个节点
Node* cur=nullptr;
for(int i=0; i<n; i++){//该层的n个逐个出来
if(i==0){//每层的最左边的节点
cur = q.front();
q.pop();
}
else{
Node* tmp = q.front();
q.pop();
cur->next = tmp;
cur = tmp;
}
if(cur->left) q.push(cur->left);//叶子节点的左右子树需要判断是否为空
if(cur->right) q.push(cur->right);
}
cur->next=nullptr;//每层最右边的指向nullptr
}
return root;
}
};