-
Notifications
You must be signed in to change notification settings - Fork 1
/
sjtu-oj1042.cpp
111 lines (105 loc) · 1.75 KB
/
sjtu-oj1042.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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include <iostream>
#include <stdio.h>
#include <queue>
using namespace std;
struct node
{
int no;
node* leftch;
node* rightsi;
node* par;
node* leftsi;
node()
{
no = -1;
leftch = NULL;
rightsi = NULL;
par = NULL;
leftsi = NULL;
}
};
void before_tra(node *root)
{
printf("%d ", root->no);
node *tmpn;
if (root->leftch) tmpn = root->leftch; else tmpn = NULL;
while (tmpn)
{
before_tra(tmpn);
tmpn = tmpn->rightsi;
}
}
void after_tra(node *root)
{
node *tmpn;
if (root->leftch) tmpn = root->leftch; else tmpn = NULL;
while (tmpn)
{
after_tra(tmpn);
tmpn = tmpn->rightsi;
}
printf("%d ", root->no);
}
void order_tra(node *root)
{
queue<node*> q;
q.push(root);
node *tmpn;
while (!q.empty())
{
tmpn = q.front();
q.pop();
printf("%d ", tmpn->no);
node *tmpn0;
if (tmpn->leftch) tmpn0 = tmpn->leftch; else tmpn0 = NULL;
while (tmpn0)
{
q.push(tmpn0);
tmpn0 = tmpn0->rightsi;
}
}
}
int main()
{
int n;
cin >> n;
node *arr = new node[n + 1];
for (int i = 1; i <= n; i++)
arr[i].no = i;
int a, b, c;
node *tmpn1;
for (int i = 0; i < n; i++)
{
scanf("%d%d%d", &a, &b, &c);
if (b != 0)
{
arr[a].leftch = &arr[b];
tmpn1 = &arr[b];
while (tmpn1)
{
tmpn1->par = &arr[a];
tmpn1 = tmpn1->rightsi;
}
}
if (c != 0)
{
arr[a].rightsi = &arr[c];
arr[c].leftsi = &arr[a];
tmpn1 = &arr[a];
while (tmpn1->leftsi)
{
tmpn1 = tmpn1->leftsi;
}
if (tmpn1->par) arr[c].par = tmpn1->par;
}
}
node *root = &arr[1];
while (root->par) root = root->par;
before_tra(root);
cout << endl;
after_tra(root);
cout << endl;
order_tra(root);
cout << endl;
return 0;
}