-
Notifications
You must be signed in to change notification settings - Fork 2
/
tree.cpp
171 lines (135 loc) · 3.16 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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
/*
* b_tree.cpp
*
*/
#include <stdlib.h>
#include <string>
#include <iostream>
#include <fstream>
#include "tree.h"
/**/
Tree::Tree() {
size = 0;
root = NULL;
}
Tree::~Tree(){ }
void Tree::add(GenericData * elem) {
root = insert(elem, root);
size ++;
}
TreeNode * Tree::insert(GenericData * elem, TreeNode *tree) {
if(tree == NULL) {
tree = new TreeNode(elem, NULL, NULL);
}
else {
if(elem->getId() < tree->getElem()->getId()) {
tree->setLeft(insert(elem, tree->getLeft()));
if(height(tree->getLeft()) - height(tree->getRight()) > 1) {
if(elem->getId() < tree->getLeft()->getElem()->getId()) {
tree = singleRotateLeft(tree);
}
else {
tree = doubleRotateLeft(tree);
}
}
}
else if(elem->getId() > tree->getElem()->getId()) {
tree->setRight(insert(elem, tree->getRight()));
if(height(tree->getRight()) - height(tree->getLeft()) > 1) {
if(elem->getId() > tree->getRight()->getElem()->getId()) {
tree = singleRotateRight(tree);
}
else {
tree = doubleRotateRight(tree);
}
}
}
}
return tree;
}
int Tree::height(TreeNode *node) const{
int left, right;
if(node==NULL)
return 0;
left = height(node->getLeft());
right = height(node->getRight());
if(left > right)
return left+1;
else
return right+1;
}
TreeNode * Tree::singleRotateLeft(TreeNode* node){
TreeNode *otherNode;
otherNode = node->getLeft();
node->setLeft(otherNode->getRight());
otherNode->setRight(node);
return otherNode;
}
TreeNode * Tree::singleRotateRight(TreeNode* node){
TreeNode *otherNode;
otherNode = node->getRight();
node->setRight(otherNode->getLeft());
otherNode->setLeft(node);
return otherNode;
}
TreeNode * Tree::doubleRotateLeft(TreeNode* node){
node->setLeft(singleRotateRight(node->getLeft()));
return singleRotateLeft(node);
}
TreeNode * Tree::doubleRotateRight(TreeNode* node){
node->setRight(singleRotateLeft(node->getRight()));
return singleRotateRight(node);
}
//bool Tree::remove(GenericData * elem) {
// TODO: remove elem
//}
bool Tree::contains(int id) const {
return get(root, id) != NULL;
}
GenericData * Tree::get(int id) const {
return get(root, id);
}
GenericData * Tree::get(TreeNode * tree, int id) const {
GenericData * res = NULL;
if(tree != NULL) {
if (tree->getElem()->getId() == id)
res = tree->getElem();
else if (id > tree->getElem()->getId())
res = get(tree->getRight(), id);
else
res = get(tree->getLeft(), id);
}
return res;
}
int Tree::getSize() const {
return size;
}
void Tree::print(std::ostream &out) const {
if (root != NULL) {
printTree(root, out);
out << std::endl;
}
}
void Tree::printTree(TreeNode* tree, std::ostream &out) const {
if(tree != NULL) {
out << "[";
printTree(tree->getLeft(), out);
out << tree->getElem()->getId();
printTree(tree->getRight(), out);
out << "]";
}
}
void Tree::list(std::ostream &out) const {
if (root != NULL) {
listTree(root, out);
out << std::endl;
}
}
void Tree::listTree(TreeNode* tree, std::ostream &out) const {
if(tree != NULL) {
listTree(tree->getLeft(), out);
//GenericData * el =
tree->getElem()->list(out);
listTree(tree->getRight(), out);
}
}