题目: https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node/
给定一个完美二叉树,其所有叶子节点都在同一层,每个父节点都有两个子节点。二叉树定义如下:
struct Node {
int val;
Node *left;
Node *right;
Node *next;
}
填充它的每个 next 指针,让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点,则将 next 指针设置为 NULL
。
初始状态下,所有 next 指针都被设置为 NULL
。
示例:
非递归方法:
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() {}
Node(int _val, Node* _left, Node* _right, Node* _next) {
val = _val;
left = _left;
right = _right;
next = _next;
}
};
*/
class Solution {
public:
queue< Node*> qnode1,qnode2;
int curk=1;
Node* connect(Node* root) {
Node* p=root,*curp;
if(p==NULL) return root;
else {
qnode1.push(p);
do {
if(curk==1) {
while(!qnode1.empty()) {
curp=qnode1.front();
qnode1.pop();
if(curp!=NULL) {
if(curp->left!=NULL)
qnode2.push(curp->left);
if(curp->right!=NULL)
qnode2.push(curp->right);
}
if(!qnode1.empty())
curp->next=qnode1.front();
}
curk=2;
} else if(curk==2) {
while(!qnode2.empty()) {
curp=qnode2.front();
qnode2.pop();
if(curp!=NULL) {
if(curp->left!=NULL)
qnode1.push(curp->left);
if(curp->right!=NULL)
qnode1.push(curp->right);
}
if(!qnode2.empty())
curp->next=qnode2.front();
}
curk=1;
}
cout<<qnode2.empty()<<" "<<qnode1.empty()<<endl;
}while(!qnode2.empty()||!qnode1.empty());
return root;
}
}
};
递归方法:
class Solution {
public:
void connect(TreeLinkNode *root) {
if(!root){
return;
}
if(root->left&&root->right){
root->left->next=root->right;
if(root->next){
root->right->next=root->next->left;
}
}
connect(root->left);
connect(root->right);
}
};