Algorithm/1991.cpp at master · miro-ring/Algorithm · GitHub

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
#include <iostream>

using namespace std;

typedef struct Node{
    char data;
    Node *leftChild;
    Node *rightChild;
}node;

void preorder_traverse(Node *R){
    cout<<R->data;
    if(R->leftChild)
        preorder_traverse(R->leftChild);
    if(R->rightChild)
        preorder_traverse(R->rightChild);

}
void inorder_traverse(Node *R){
    if(R->leftChild)
        inorder_traverse(R->leftChild);

    cout<<R->data;

    if(R->rightChild)
        inorder_traverse(R->rightChild);
}
void postorder_traverse (Node *R){
    if(R->leftChild)
        postorder_traverse(R->leftChild);
    if(R->rightChild)
        postorder_traverse(R->rightChild);

    cout<<R->data;
}


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int num;
    char tmp1,tmp2,tmp3;
    cin>>num;
    Node *tree = new Node[num];
    for(int i=0;i<num;i++)
    {
        cin>>tmp1>>tmp2>>tmp3;
        int value=tmp1-'A'; //A를 root로 잡기 위해 A일 경우 이렇게 0이 되게 만든다.
        tree[value].data=tmp1;
        if(tmp2=='.')
        {
            tree[value].leftChild=NULL;
        }
        else
        {
            tree[value].leftChild=&tree[tmp2-'A']; //tree 전체가 딸려와야한다.
        }
        if(tmp3=='.')
        {
            tree[value].rightChild=NULL;
        }
        else
        {
            tree[value].rightChild=&tree[tmp3-'A'];
        }

    }
    preorder_traverse(&tree[0]);
    cout<<"\n";
    inorder_traverse(&tree[0]);
    cout<<"\n";
    postorder_traverse(&tree[0]);

}