Given a binary tree
struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL
.
Initially, all next pointers are set to NULL
.
Note:
- You may only use constant extra space.
- You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).
For example,
Given the following perfect binary tree,
1 / \ 2 3 / \ / \ 4 5 6 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ / \ 4->5->6->7 -> NULL
题意:为每个结点设置next指针,若右边没有元素,则next指针为NULL。
思路:1.设置一个标志位flag用于判断是否为最右的结点;
2.若flag为true,则说明当前结点为最右的结点,它的next指向NULL;
3.若当前结点存在左结点,则将左结点的next指向右结点;
4.若右结点存在且flag为false的话,则需要将右结点的next指向相邻结点的left,即node->right->next=node->next->left;
5.递归到左结点和右结点,需要注意的是,右结点的flag保持不变,左结点的flag设置为false。
代码如下:
/**
* Definition for binary tree with next pointer.
* struct TreeLinkNode {
* int val;
* TreeLinkNode *left, *right, *next;
* TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
public:
void connect(TreeLinkNode *root) {
f(root,true);
}
void f(TreeLinkNode *node,bool flag){
if(node == NULL)
return ;
if(flag == true)
node->next = NULL;
if(node->left != NULL)
node->left->next = node->right;
if(node->right != NULL && flag == false)
node->right->next = node->next->left;
f(node->right,flag);
f(node->left,false);
}
};