forked from codesession/Data-structure-Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinarySearchTree.cpp
More file actions
147 lines (140 loc) · 2.43 KB
/
BinarySearchTree.cpp
File metadata and controls
147 lines (140 loc) · 2.43 KB
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
#include"BinarySearchTree.h"
BST::treenode* BST::find(int val)
{
if (nodecount == 0) return nullptr;
treenode* temp = root;
while (temp->value != val)
{
while (temp != nullptr && temp->value > val) temp = temp->left;
while (temp != nullptr && temp->value < val) temp = temp->right;
if (temp == nullptr) return nullptr;
}
return temp;
}
int BST::deletemin(treenode*& node)
{
if (node->left == nullptr)
{
int res = node->value;
if (node->right != nullptr)
{
treenode* temp = node;
node = node->right;
delete temp;
}
else
{
delete node;
node = nullptr;
}
return res;
}
else
return deletemin(node->left);
}
void BST::insert(int val)
{
if (nodecount == 0) root->value = val;
else
{
treenode* temp = root;
for (;;)
{
if (val >= temp->value)
{
if (temp->right != nullptr)
temp = temp->right;
else
{
temp->setright(val);
break;
}
}
else
{
if (temp->left != nullptr)
temp = temp->left;
else
{
temp->setleft(val);
break;
}
}
}
}
nodecount++;
}
bool BST::removehelp(treenode*& node, int val)
{
if (node == nullptr)
{
std::cout << "can't find " << val << std::endl;
return false;
}
else if (node->value == val)
{
nodecount--;
if (node->left == nullptr && node->right == nullptr)
{
delete node;
node = nullptr;
}
else if (node->left == nullptr)
{
treenode* temp = node;
node = node->right;
delete temp;
}
else if (node->right == nullptr)
{
treenode* temp = node;
node = node->left;
delete temp;
}
else
{
node->value = deletemin(node->right);
}
return true;
}
else
{
if (node->value > val) return removehelp(node->left, val);
else if (node->value < val) return removehelp(node->right, val);
}
}
void BST::clearall(treenode* node)
{
if (node == nullptr) return;
clearall(node->left);
clearall(node->right);
delete node;
}
void BST::print(treenode* node)
{
if (node == nullptr) return;
print(node->left);
std::cout << node->value << " ";
print(node->right);
}
int main(int argc, char const *argv[])
{
BST mybst;
mybst.insert(190);
mybst.insert(200);
mybst.insert(20);
mybst.insert(22);
mybst.insert(24);
mybst.insert(201);
mybst.insert(20);
mybst.insert(11);
mybst.remove(20);
mybst.remove(22);
mybst.remove(11);
mybst.remove(190);
mybst.remove(33);
mybst.remove(24);
mybst.printbyorder();
std::cout << "BST nodecount:" << mybst.size() << std::endl;
return 0;
}