-
Notifications
You must be signed in to change notification settings - Fork 0
/
binarySearchTree.c
123 lines (102 loc) · 2.59 KB
/
binarySearchTree.c
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
#include "binarySearchTree.h"
NODE * createNode(int key, NODEDATA * value)
{
NODE * node = malloc(sizeof(NODE));
node->key = key;
node->value = value;
node->parent = NULL;
node->left = NULL;
node->right = NULL;
return node;
}
NODE * findNode(NODE * rootNode, int key)
{
if (rootNode == NULL)
return NULL;
if (key < rootNode->key)
return findNode(rootNode->left, key);
else if (key > rootNode->key)
return findNode(rootNode->right, key);
return rootNode;
}
void insertNode(NODE * rootNode, int key, NODEDATA * value)
{
NODE * newNode = createNode(key, value);
NODE * parentNode = findParentNode(rootNode, key);
if (parentNode == NULL)
{
throwException(1);
return;
}
newNode->parent = parentNode;
if (key < parentNode->key && !parentNode->left)
parentNode->left = newNode;
else if (key > parentNode->key && !parentNode->right)
parentNode->right = newNode;
else
throwException(2);
}
void deleteNode(NODE * rootNode, int key)
{
NODE * targetNode = findNode(rootNode, key);
NODE * successorNode;
if (targetNode == NULL)
return;
if (targetNode->left && targetNode->right) // both children
{
successorNode = findMinNode(targetNode->right);
targetNode->key = successorNode->key;
targetNode->value = successorNode->value;
deleteNode(successorNode, successorNode->key);
}
else if (targetNode->left) // only left child
replaceNodeInParent(targetNode, targetNode->left);
else if (targetNode->right) // only right child
replaceNodeInParent(targetNode, targetNode->right);
else // no children
replaceNodeInParent(targetNode, NULL);
}
void traverseNode(NODE * rootNode, void(*callbackFunc)(NODEDATA *))
{
if (rootNode == NULL)
return;
traverseNode(rootNode->left, callbackFunc);
callbackFunc(rootNode->value);
traverseNode(rootNode->right, callbackFunc);
}
static NODE * findParentNode(NODE * rootNode, int key)
{
NODE ** targetPos = NULL;
if (!rootNode)
return NULL;
if (key < rootNode->key)
targetPos = &(rootNode->left);
else if (key > rootNode->key)
targetPos = &(rootNode->right);
else if (key == rootNode->key)
return NULL;
if (*targetPos)
return findParentNode(*targetPos, key);
else
return rootNode;
}
static NODE * findMinNode(NODE * rootNode)
{
NODE * curNode = rootNode;
while (curNode->left)
curNode = curNode->left;
return curNode;
}
static void replaceNodeInParent(NODE * node, NODE * destNode)
{
NODE ** targetPos = NULL;
if (node->parent)
{
if (node->parent->left == node)
node->parent->left = destNode;
else if (node->parent->right == node)
node->parent->right = destNode;
if (destNode)
destNode->parent = node->parent;
}
}