This repository was archived by the owner on Jan 27, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAVLTree.cpp
More file actions
254 lines (188 loc) · 5.27 KB
/
Copy pathAVLTree.cpp
File metadata and controls
254 lines (188 loc) · 5.27 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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
/*-------------------------------------------------------------------------+
| Name: Jerome Richards |
| Course: CNS-2400 F01 |
| |
| Project: AVL Binary Search Tree |
| |
| File: AVLTree.cpp |
| |
| Implement an AVL binary search tree (AVLTree) class |
+-------------------------------------------------------------------------*/
#include <string>
#include <iostream>
#include "AVLTree.h"
using namespace std;
AVLTree::AVLTree()
{
_itsRoot = NULL;
}
AVLTree::~AVLTree()
{
killNodes( _itsRoot );
}
void AVLTree::killNodes( charNode* tmpNode )
{
// make sure it is a valid node
if( ! tmpNode )
return;
// delete all left nodes
if( tmpNode->_lchild )
killNodes( tmpNode->_lchild );
// delete all right nodes
if( tmpNode->_rchild )
killNodes( tmpNode->_rchild );
delete tmpNode;
}
bool AVLTree::insertNode( char tmpData )
{
return _searchInsert( tmpData, _itsRoot );
}
bool AVLTree::_searchInsert( char tmpData, charNode*& tmpNode )
{
// is it a new node
if( ! tmpNode )
{
tmpNode = new(nothrow) charNode( tmpData, NULL, NULL );
if( tmpNode )
return true;
else
return false;
}
if( tmpData < tmpNode->_itsData )
return _searchInsert( tmpData, tmpNode->_lchild );
else if( tmpData > tmpNode->_itsData )
return _searchInsert( tmpData, tmpNode->_rchild );
return false;
}
bool AVLTree::removeNode( char tmpData )
{
return _searchRemove( tmpData, _itsRoot );
}
bool AVLTree::_searchRemove( char tmpData, charNode*& tmpNode )
{
if( ! tmpNode )
return false;
if( tmpNode->_itsData == tmpData )
return _delNode( tmpNode );
if( tmpData < tmpNode->_itsData )
return _searchRemove( tmpData, tmpNode->_lchild );
else
return _searchRemove( tmpData, tmpNode->_rchild );
}
bool AVLTree::_delNode( charNode*& tmpNode )
{
if( ! tmpNode )
return false;
// save node to delete
charNode* killNode = tmpNode;
if( ! tmpNode->_rchild )
{
// if no right subtree replace the parent with the left subtree
tmpNode = tmpNode->_lchild;
}
else if( ! tmpNode->_lchild )
{
// if no left subtree replace the parent with the right subtree
tmpNode = tmpNode->_rchild;
}
else
{
killNode = tmpNode->_lchild;
charNode* tmpParent = tmpNode;
while( killNode->_rchild )
{
tmpParent = killNode;
killNode = killNode->_rchild;
}
tmpNode->_itsData = killNode->_itsData;
if( tmpParent == tmpNode )
tmpNode->_lchild = killNode->_lchild;
else
tmpParent->_rchild = killNode->_lchild;
}
delete killNode;
return true;
}
bool AVLTree::searchNode( char tmpData )
{
charNode* tmpNode = _itsRoot;
return _findNode( tmpData, tmpNode );
}
bool AVLTree::_findNode( char tmpData, charNode*& tmpNode )
{
bool lFound = false;
if( tmpNode )
{
// obvious case, a match is found at the node
if( tmpNode->_itsData == tmpData )
return true;
if( tmpData < tmpNode->_itsData )
{
// anything on the left side of the tree?
if( ! tmpNode->_lchild )
return false;
tmpNode = tmpNode->_lchild;
lFound = _findNode( tmpData, tmpNode );
}
else
{
// anything on the right side of the tree?
if( ! tmpNode->_rchild )
return false;
tmpNode = tmpNode->_rchild;
lFound = _findNode( tmpData, tmpNode );
}
}
return lFound;
}
void AVLTree::preOrder( void (*UDF)( char ) )
{
_intPreOrder( _itsRoot, UDF );
}
void AVLTree::_intPreOrder( charNode* tmpNode, void (*UDF)( char ) )
{
if( ! tmpNode )
return;
// visit the node first
(*UDF)( tmpNode->_itsData );
// process all left nodes first
if( tmpNode->_lchild )
_intPreOrder( tmpNode->_lchild, UDF );
// process all right nodes
if( tmpNode->_rchild )
_intPreOrder( tmpNode->_rchild, UDF );
}
void AVLTree::inOrder( void (*UDF)( char ) )
{
_intInOrder( _itsRoot, UDF );
}
void AVLTree::_intInOrder( charNode* tmpNode, void (*UDF)( char ) )
{
if( ! tmpNode )
return;
// process all left child nodes first
if( tmpNode->_lchild )
_intInOrder( tmpNode->_lchild, UDF );
// visit the node
(*UDF)( tmpNode->_itsData );
// process all right child nodes
if( tmpNode->_rchild )
_intInOrder( tmpNode->_rchild, UDF );
}
void AVLTree::postOrder( void (*UDF)( char ) )
{
_intPostOrder( _itsRoot, UDF );
}
void AVLTree::_intPostOrder( charNode* tmpNode, void (*UDF)( char ) )
{
if( ! tmpNode )
return;
// process the left nodes first
if( tmpNode->_lchild )
_intPostOrder( tmpNode->_lchild, UDF );
// process the right nodes
if( tmpNode->_rchild )
_intPostOrder( tmpNode->_rchild, UDF );
// visit the node
(*UDF)( tmpNode->_itsData );
}