-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtree.h
105 lines (94 loc) · 2.1 KB
/
tree.h
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
#ifndef TREE_H
#define TREE_H
#include <vector>
#include <queue>
#include <stack>
#include "type.h"
using namespace std;
class Node {
vector<Node*> children;
Node* parent;
Node* brother;
Symbol symbol;
public:
Node(Symbol _symbol) {
symbol = _symbol;
brother = nullptr;
parent = nullptr;
}
~Node() {
for (auto c : children) {
delete c;
}
delete brother;
delete parent;
}
Node* getParent() const {
return parent;
}
Symbol getSymbol() const {
return symbol;
}
Node* getChild(int index) const {
return children[index];
}
Node* getBrother() const {
return brother;
}
void setSymbol(Symbol s) {
symbol = s;
}
void setBrother(Node* bro) {
brother = bro;
}
void setParent(Node* pa) {
parent = pa;
}
void insertChild(Node* n) {
if (children.empty()) {
n->setBrother(nullptr);
} else {
n->setBrother(*children.begin());
}
n->setParent(this);
children.insert(children.begin(), n);
}
void visitTreePreOrder() {
stack<Node*> stk;
stk.push(this);
Node* p = this;
while (!stk.empty()) {
p = stk.top();
cout << *p;
stk.pop();
for (auto it = p->children.rbegin(); it != p->children.rend(); it++) {
stk.push(*it);
}
}
cout << endl;
cout << endl;
}
void visitLevelOrder() {
queue<Node*> q;
q.push(this);
Node* p;
while (!q.empty()) {
int n = q.size();
while (n--) {
p = q.front();
cout << *p;
q.pop();
for (auto child : p->children) {
q.push(child);
}
}
cout << endl;
}
cout << endl;
cout << endl;
}
friend ostream& operator<<(std::ostream &s, const Node& node) {
return s << node.symbol << " ";
}
};
#endif