大家好，又见面了，我是全栈君。
Follow up for problem “Populating Next Right Pointers in Each Node“.
What if the given tree could be any binary tree?
Would your previous solution still work?
Note:
- You may only use constant extra space.
For example,
Given the following binary tree,
1
/ \
2 3
/ \ \
4 5 7
After calling your function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ \
4-> 5 -> 7 -> NULL
/**
* 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) {}
* };
*/
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) {
TreeLinkNode *head = NULL;
TreeLinkNode *prev = NULL;
TreeLinkNode *cur = root;
while(cur != NULL)
{
while(cur != NULL)
{
if(cur->left != NULL)
{
if(prev != NULL)
{
prev->next = cur->left;
}
else
{
head = cur->left;
}
prev = cur->left;
}
if(cur->right != NULL)
{
if(prev != NULL)
{
prev->next = cur->right;
}
else
{
head = cur->right;
}
prev = cur->right;
}
cur = cur->next;
}
cur = head;
head = NULL;
prev = NULL;
}
}
};
版权声明：本文内容由互联网用户自发贡献，该文观点仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 举报，一经查实，本站将立刻删除。
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/116532.html原文链接：https://javaforall.net
