给定一个二叉树
struct Node {
int val;
Node *left;
Node *right;
Node *next;
}
填充它的每个 next 指针,让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点,则将 next 指针设置为 NULL。
初始状态下,所有 next 指针都被设置为 NULL。
进阶:
你只能使用常量级额外空间。
使用递归解题也符合要求,本题中递归程序占用的栈空间不算做额外的空间复杂度。
示例:
输入:root = [1,2,3,4,5,null,7]
输出:[1,#,2,3,#,4,5,7,#]
解释:给定二叉树如图 A 所示,你的函数应该填充它的每个 next 指针,以指向其下一个右侧节点,如图 B 所示。序列化输出按层序遍历顺序(由 next 指针连接),'#' 表示每层的末尾。
提示:
树中的节点数小于 6000
-100 <= node.val <= 100
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/populating-next-right-pointers-in-each-node-ii
思路:
层序遍历二叉树,将各层的 节点相连
java代码:
/*
// Definition for a Node.
class Node {
public int val;
public Node left;
public Node right;
public Node next;
public Node() {}
public Node(int _val) {
val = _val;
}
public 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==null) {
return root;
}
Queue<Node> queue = new LinkedBlockingQueue<>();
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
Node lastNode = null;
for(int i=0;i<size;i++) {
Node current = queue.poll();
if(lastNode !=null) {
lastNode.next = current;
}
lastNode = current;
if(current != null) {
if(current.left != null) {
queue.offer(current.left);
}
if(current.right != null) {
queue.offer(current.right);
}
}
}
}
return root;
}
}
c++
/*
// 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 == NULL) {
return root;
}
queue<Node*> result;
result.push(root);
while(!result.empty()) {
int len = result.size();
Node* lastNode = NULL;
for(int i = 0; i<len; i++) {
Node* currentNode = result.front();
if(lastNode != NULL) {
lastNode->next = currentNode;
}
lastNode = currentNode;
Node* leftNode = currentNode->left;
Node* rightNode = currentNode->right;
if(leftNode != NULL) {
result.push(leftNode);
}
if(rightNode != NULL) {
result.push(rightNode);
}
result.pop();
}
}
return root;
}
};