题目大意
给定一个完美二叉树,其所有叶子节点都在同一层,每个父节点都有两个子节点。二叉树定义如下:
struct Node {
int val;
Node *left;
Node *right;
Node *next;
}
填充它的每个 next 指针,让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点,则将 next 指针设置为 NULL。
初始状态下,所有 next 指针都被设置为 NULL。
示例:
输入:{"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":null,"right":null,"val":4},"next":null,"right":{"$id":"4","left":null,"next":null,"right":null,"val":5},"val":2},"next":null,"right":{"$id":"5","left":{"$id":"6","left":null,"next":null,"right":null,"val":6},"next":null,"right":{"$id":"7","left":null,"next":null,"right":null,"val":7},"val":3},"val":1}
输出:{"$id":"1","left":{"$id":"2","left":{"$id":"3","left":null,"next":{"$id":"4","left":null,"next":{"$id":"5","left":null,"next":{"$id":"6","left":null,"next":null,"right":null,"val":7},"right":null,"val":6},"right":null,"val":5},"right":null,"val":4},"next":{"$id":"7","left":{"$ref":"5"},"next":null,"right":{"$ref":"6"},"val":3},"right":{"$ref":"4"},"val":2},"next":null,"right":{"$ref":"7"},"val":1}
解释:给定二叉树如图 A 所示,你的函数应该填充它的每个 next 指针,以指向其下一个右侧节点,如图 B 所示。
提示:
- 你只能使用常量级额外空间。
- 使用递归解题也符合要求,本题中递归程序占用的栈空间不算做额外的空间复杂度。
解题思路
只要按照层序遍历即可。若某个节点不是这一层的最后一个节点,则从队列中弹出来后,让next指针指向队列的第一个元素即可。
class Solution {
public:
Node* connect(Node* root) {
if (!root){
return nullptr;
}
int count = 1;
queue<Node*> myqueue;
Node * tmp = root;
myqueue.push(tmp);
while (!myqueue.empty()){
for (int i = 0; i < count; ++i){
tmp = myqueue.front(); myqueue.pop();
// 由于是满二叉树,所以有只要有左子树一定有右子树(否则就是叶子结点了)
if (tmp->left){
myqueue.push(tmp->left);
myqueue.push(tmp->right);
}
// 如果该节点不是本层的最后一个节点
if (i != count - 1){
tmp->next = myqueue.front();
}
}
// 记录每一层的节点数量
count *= 2;
}
return root;
}
};