-
Notifications
You must be signed in to change notification settings - Fork 0
/
트리순회.cpp
83 lines (61 loc) · 1.31 KB
/
트리순회.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
// 1991 - 트리 순회
#include <iostream>
using namespace std;
typedef struct Node {
char data;
Node* left;
Node* right;
} Node;
void preorder(Node *node);
void inorder(Node *node);
void postorder(Node *node);
int main() {
int n;
Node* nodes;
cin >> n;
nodes = (Node*)malloc(sizeof(Node) * n);
for (int i = 0; i < n; i++) {
char a, b, c;
cin >> a >> b >> c;
nodes[a - 'A'].data = a;
if (b == '.')
nodes[a - 'A'].left = NULL;
else
nodes[a - 'A'].left = &nodes[b - 'A'];
if (c == '.')
nodes[a - 'A'].right = NULL;
else
nodes[a - 'A'].right = &nodes[c - 'A'];
}
// 전위
preorder(&nodes[0]);
cout << endl;
// 중위
inorder(&nodes[0]);
cout << endl;
// 후위
postorder(&nodes[0]);
free(nodes);
return 0;
}
void preorder(Node* node) {
if (node == NULL)
return;
cout << node->data;
preorder(node->left);
preorder(node->right);
}
void inorder(Node* node) {
if (node == NULL)
return;
inorder(node->left);
cout << node->data;
inorder(node->right);
}
void postorder(Node* node) {
if (node == NULL)
return;
postorder(node->left);
postorder(node->right);
cout << node->data;
}