-
Notifications
You must be signed in to change notification settings - Fork 1
/
PopulatingNextRightPointersinEachNodeII.cpp
76 lines (66 loc) · 1.75 KB
/
PopulatingNextRightPointersinEachNodeII.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*
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) {}
* };
*/
class Solution {
public:
TreeLinkNode* GetNext(TreeLinkNode *parent)
{
if(!parent)
return NULL;
else if(parent->left)
return parent->left;
else if(parent->right)
return parent->right;
else
return GetNext(parent->next);
}
void connect(TreeLinkNode *root) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
if(!root)
return;
// root->next = NULL;
TreeLinkNode *left =root;
while(left)
{
root = left;
while(root)
{
if(root->left && root->right)
{
root->left->next = root->right;
root->right->next = GetNext(root->next);
}
else if(root->left || root->right)
GetNext(root)->next = GetNext(root->next);
root = root->next;
}
left = GetNext(left);
}
return;
}
};