-
Notifications
You must be signed in to change notification settings - Fork 0
/
d23151006.cpp
61 lines (54 loc) · 1.39 KB
/
d23151006.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
#include <cstdio>
//populating-next-right-pointers-in-each-node
struct TreeLinkNode {
int val;
TreeLinkNode *left, *right, *next;
TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
};
void connect(TreeLinkNode *root)
{
TreeLinkNode *p = root;
TreeLinkNode *pMostLeft = p;
TreeLinkNode *pCurL;
TreeLinkNode *pCurR;
while (pMostLeft) {
p = pMostLeft;
printf("level:%d\n", pMostLeft->val);
pCurR = NULL;
do {
printf("p=%d ", p->val);
pCurL = p->left;
if (pCurR) pCurR->next = pCurL;
pCurR = p->right;
if (pCurL) pCurL->next = pCurR;
p = p->next;
}while(p);
printf("\n");
pMostLeft = pMostLeft->left;
}
}
void printTree(TreeLinkNode *root)
{
TreeLinkNode *p = root;
if (p) {
printf("node[%d]->next=%d\n", p->val, (p->next)? p->next->val : 0);
printTree(p->left);
printTree(p->right);
}
}
int main()
{
TreeLinkNode *p = new TreeLinkNode(1);
p->left = new TreeLinkNode(2);
TreeLinkNode *pL = p->left;
pL->left = new TreeLinkNode(4);
pL->right = new TreeLinkNode(5);
p->right = new TreeLinkNode(3);
TreeLinkNode *pR = p->right;
pR->left = new TreeLinkNode(6);
pR->right = new TreeLinkNode(7);
connect(p);
printf("\n--------------\n");
printTree(p);
return 0;
}