-
Notifications
You must be signed in to change notification settings - Fork 0
/
BinaryTree.cpp
164 lines (152 loc) · 3.02 KB
/
BinaryTree.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
#include <stdlib.h>
#include <stdio.h>
#include "BinaryTree.h"
Tree* TreeInit(Tree** tree)
{
*tree = (Tree*)malloc(sizeof(Tree));
if ( *tree )
{
(*tree)->parent = NULL;
(*tree)->left = NULL;
(*tree)->right = NULL;
(*tree)->data = NULL;
}
return *tree;
}
Tree* TreeInsert(Tree** tree, void* element, Tree* parent, int (*comp)(const void*, const void*))
{
if ( !*tree )
{
TreeInit(tree);
(*tree)->parent = parent;
(*tree)->data = element;
return *tree;
}
else
{
if ( (*comp)(element, (*tree)->data) < 0 )
{
return TreeInsert(&(*tree)->left, element, *tree, comp);
}
else
{
return TreeInsert(&(*tree)->right, element, *tree, comp);
}
}
}
void TreePreOrder(Tree* tree, void (*func)(void*))
{
(*func)(tree->data);
if ( tree->left )
{
TreePreOrder(tree->left, func);
}
if ( tree->right )
{
TreePreOrder(tree->right, func);
}
}
void TreeInOrder(Tree* tree, void (*func)(void*))
{
if ( tree->left )
{
TreePreOrder(tree->left, func);
}
(*func)(tree->data);
if ( tree->right )
{
TreePreOrder(tree->right, func);
}
}
void TreePostOrder(Tree* tree, void (*func)(void*))
{
if ( tree->left )
{
TreePreOrder(tree->left, func);
}
if ( tree->right )
{
TreePreOrder(tree->right, func);
}
(*func)(tree->data);
}
Tree* TreeMin(Tree* tree)
{
if ( tree && tree->left )
return TreeMin(tree->left);
else
return tree;
}
Tree* TreeMax(Tree* tree)
{
if ( tree && tree->right )
return TreeMax(tree->right);
else
return tree;
}
Tree* TreeSearch(Tree* tree, void* element, int (*comp)(const void*, const void*))
{
int res = (*comp)(element, tree->data);
if ( res < 0 )
return tree->left ? TreeSearch(tree->left, element, comp) : NULL;
else if ( res > 0 )
return tree->right ? TreeSearch(tree->right, element, comp) : NULL;
else
return tree;
}
static void TreeDoDelete(Tree* toDelete)
{
if ( toDelete->left && toDelete->right )
{
Tree* minTree = TreeMin(toDelete->right);
toDelete->data = minTree->data;
TreeDoDelete(minTree);
}
else if ( toDelete->left )
{
toDelete->data = toDelete->left->data;
TreeDestroy(toDelete->left);
}
else if ( toDelete->right )
{
toDelete->data = toDelete->right->data;
TreeDestroy(toDelete->right);
}
else
{
if ( toDelete->parent )
{
if ( toDelete->parent->left == toDelete )
toDelete->parent->left = NULL;
else if ( toDelete->parent->right == toDelete )
toDelete->parent->right = NULL;
}
TreeDestroy(toDelete);
}
}
int TreeDelete(Tree* tree, void* element, int (*comp)(const void*, const void*))
{
Tree* toDelete = TreeSearch(tree, element, comp);
if ( toDelete )
{
TreeDoDelete(toDelete);
return 1;
}
return 0;
}
void TreeDestroy(Tree* tree)
{
if ( tree->left )
{
printf("left ");
TreeDestroy(tree->left);
tree->left = NULL;
}
if ( tree->right )
{
printf("right ");
TreeDestroy(tree->right);
tree->right = NULL;
}
free(tree);
}