-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.cpp
130 lines (108 loc) · 2.44 KB
/
tree.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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <iostream>
class Node {
public:
char value;
Node* bigger;
Node* smaller;
Node(char value) {
this->value = value;
this->bigger = this->smaller = NULL;
}
};
class Tree {
Node* root;
void _paint(Node* p) {
std::cout << p->value;
if (p->smaller || p->bigger) {
std::cout << "(";
if (p->smaller)
this->_paint(p->smaller);
else
std::cout << "_";
std::cout << ", ";
if (p->bigger)
this->_paint(p->bigger);
else
std::cout << "_";
std::cout << ")";
}
}
void _add(Node* p, char value) {
// std::cout << "_add" << std::endl;
Node** t;
if (value < p->value) {
t = &p->smaller;
} else {
t = &p->bigger;
}
if((*t) == NULL)
(*t) = new Node(value);
else
this->_add((*t), value);
}
bool _find(Node* p, char value) {
if (p->value == value) {
return true;
}
Node** t;
if (value < p->value) {
t = &p->smaller;
} else {
t = &p->bigger;
}
if ((*t) == NULL)
return false;
else
return this->_find((*t), value);
}
public:
Tree() {
this->root = NULL;
}
void grow(std::string& in) {
std::cout << "Growing a tree with seed: "<< in << std::endl;
for(int i = 0; i < in.size(); i++) {
this->add(in[i]);
}
}
void paint() {
// wild guess the starting padding
std::string padding = " ";
if(this->root == NULL) {
std::cout << "Earth. Sky.";
}
this->_paint(this->root);
std::cout << std::endl;
}
void add(char value) {
if(this->root == NULL) {
this->root = new Node(value);
} else {
this->_add(this->root, value);
}
}
bool find(char value) {
if(this->root == NULL)
return false;
return this->_find(this->root, value);
}
};
int main() {
std::string in = "abfskjrewklcxkjckjdsnfirenfreee";
Tree* t = new Tree();
t->grow(in);
std::cout << "Painted tree: \n";
t->paint();
std::cout << "Did we find 'i' on the tree? \n";
std::cout << (t->find("i"[0]) ? "yes": "no");
std::cout << std::endl;
std::cout << "Did we find 'g' on the tree? \n";
std::cout << (t->find("g"[0]) ? "yes": "no");
std::cout << std::endl;
std::cout << "In-order: \n";
t->in_order();
// std::cout << "---------------" << std::endl;
// std::string a = "lala";
// std::cout << (int)33/2;
std::cout << std::endl;
}