-
Notifications
You must be signed in to change notification settings - Fork 0
/
W7_PostOrderTraversal3.cpp
72 lines (64 loc) · 1.37 KB
/
W7_PostOrderTraversal3.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
//Created by dongwan-kim on 2022/04/13.
#include<iostream>
#include<vector>
using namespace std;
class Node{
public:
Node* parent;
int value;
vector<Node*> childList;
Node(){
parent= nullptr;
value=0;
}
};
class Tree{
public:
Node *root;
vector<Node*> nodeList;
Tree(){
root=new Node;
root->value=1;
nodeList.push_back(root);
}
Node *findNode(int v){
for(int i=0;i<nodeList.size();i++){
if(nodeList[i]->value==v)
return nodeList[i];
}
return nullptr;
}
void insertNode(int parentv,int v){
Node *parentNode= findNode(parentv);
Node *newNode=new Node;
newNode->value=v;
newNode->parent=parentNode;
parentNode->childList.push_back(newNode);
nodeList.push_back(newNode);
}
void postOrderTraversal(Node *r){
for(int i=0;i<r->childList.size();i++){
postOrderTraversal(r->childList[i]);
}
if(r==root){
cout<<0<<" ";
}
else
cout<<r->parent->value<<" ";
}
};
int main(){
int t,n;
cin>>t;
while(t--){
Tree tree;
cin>>n;
while(n--){
int a,b;
cin>>a>>b;
tree.insertNode(a,b);
}
tree.postOrderTraversal(tree.root);
cout<<endl;
}
}