-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST - General.js
205 lines (114 loc) · 3.81 KB
/
BST - General.js
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
// Define a Node class to represent each node in the binary search tree
class Node {
constructor(data) {
this.data = data;
this.left = null;
this.right = null;
}
}
// Define the BinarySearchTree class to represent the binary search tree
class BinarySearchTree {
constructor() {
this.root = null;
}
// Insertion function to add a new node to the binary search tree
insert(data) {
let newNode = new Node(data);
if (this.root === null) {
this.root = newNode;
return this;
} else {
let current = this.root;
while (true) {
if (data === current.data) {
// If the given data is same as the current node data, then don't insert to avoid duplicates
return undefined;
}
if (data < current.data) {
if (current.left === null) {
current.left = newNode;
return this;
}
current = current.left;
} else {
if (current.right === null) {
current.right = newNode;
return this;
}
current = current.right;
}
}
}
}
// Searching function to find a node in the binary search tree
searchTree(data){
if(this.root == null){
console.log("Empty Tree");
return false;
}
let currentNode = this.root;
while(currentNode != null){
if(currentNode.data == data){
return currentNode;
}else if(data < currentNode.data){
currentNode = currentNode.left;
}else{
currentNode = currentNode.right;
}
}
return false; // The search data is not found in the tree.
}
// Deletion function to remove a node from the binary search tree
delete(data) {
function findMinNode(node) {
while (node.left !== null) {
node = node.left;
}
return node;
}
function deleteNode(node, data) {
if (node === null) {
return null;
}
if (data === node.data) {
// node has NO children
if (node.left === null && node.right === null) {
return null;
}
// node has RIGHT child
if (node.left === null) {
return node.right;
}
// node has LEFT child
if (node.right === null) {
return node.left;
}
// node has TWO children
let tempNode = findMinNode(node.right);
node.data = tempNode.data;
node.right = deleteNode(node.right, tempNode.data);
return node;
} else if (data < node.data) {
node.left = deleteNode(node.left, data);
return node;
} else {
node.right = deleteNode(node.right, data);
return node;
}
}
this.root = deleteNode(this.root, data);
return this;
}
}
// =================================TEST CASES=================================
let tree1 = new BinarySearchTree();
tree1.insert(10);
tree1.insert(5);
tree1.insert(15);
tree1.insert(2);
tree1.insert(7);
tree1.insert(12);
tree1.insert(20);
console.log(tree1.searchTree(15));
tree1.delete(15);
console.log(tree1.searchTree(15));