-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathbst.js
More file actions
494 lines (451 loc) · 14 KB
/
bst.js
File metadata and controls
494 lines (451 loc) · 14 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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
/*
* File: bst.js
*
* A pure JavaScript implementation of a binary search tree.
*
*/
/*
* Class: BST
*
* The binary search tree class.
*
*/
var BST = function () {
/*
* Private Class: Node
*
* A BST node constructor
*
* Parameters:
*
* leftChild - a reference to the left child of the node.
* key - The key of the node.
* value - the value of the node.
* rightChild - a reference to the right child of the node.
* parent - a reference to the parent of the node.
*
* Note: All parameters default to null.
*
*/
var Node = function (leftChild, key, value, rightChild, parent) {
return {
leftChild: (typeof leftChild === "undefined") ? null :
leftChild,
key: (typeof key === "undefined") ? null : key,
value: (typeof value === "undefined") ? null : value,
rightChild: (typeof rightChild === "undefined") ? null :
rightChild,
parent: (typeof parent === "undefined") ? null : parent
};
},
/*
* Private Variable: root
*
* The root nade of the BST.
*
*/
root = new Node(),
/*
* Private Method: searchNode
*
* Search through a binary tree.
*
* Parameters:
*
* node - the node to search on.
* key - the key to search for (as an integer).
*
* Returns:
*
* the value of the found node,
* or null if no node was found.
*
*/
searchNode = function (node, key) {
if (node.key === null) {
return null; // key not found
}
var nodeKey = parseInt(node.key, 10);
if (key < nodeKey) {
return searchNode(node.leftChild, key);
} else if (key > nodeKey) {
return searchNode(node.rightChild, key);
} else { // key is equal to node key
return node.value;
}
},
/*
* Private Method: insertNode
*
* Insert into a binary tree.
*
* Parameters:
*
* node - the node to search on.
* key - the key to insert (as an integer).
* value - the value to associate with the key (any type of
* object).
*
* Returns:
*
* true.
*
*/
insertNode = function (node, key, value, parent) {
if (node.key === null) {
node.leftChild = new Node();
node.key = key;
node.value = value;
node.rightChild = new Node();
node.parent = parent;
return true;
}
var nodeKey = parseInt(node.key, 10);
if (key < nodeKey) {
return insertNode(node.leftChild, key, value, node);
} else if (key > nodeKey) {
return insertNode(node.rightChild, key, value, node);
} else { // key is equal to node key, update the value
node.value = value;
return true;
}
},
/*
* Private Method: traverseNode
*
* Call a function on each node of a binary tree.
*
* Parameters:
*
* node - the node to traverse.
* callback - the function to call on each node, this function
* takes a key and a value as parameters.
*
* Returns:
*
* true.
*
*/
traverseNode = function (node, callback) {
if (node.key !== null) {
traverseNode(node.leftChild, callback);
callback(node.key, node.value);
traverseNode(node.rightChild, callback);
}
return true;
},
/*
* Private Method: minNode
*
* Find the key of the node with the lowest key number.
*
* Parameters:
*
* node - the node to traverse.
*
* Returns:
*
* the key of the node with the lowest key number.
*
*/
minNode = function (node) {
if (node.leftChild.key !== null) {
return minNode(node.leftChild);
} else {
return node.key;
}
},
/*
* Private Method: maxNode
*
* Find the key of the node with the highest key number.
*
* Parameters:
*
* node - the node to traverse.
*
* Returns:
*
* the key of the node with the highest key number.
*
*/
maxNode = function (node) {
if (node.rightChild.key !== null) {
return maxNode(node.rightChild);
} else {
return node.key;
}
},
/*
* Private Method: successorNode
*
* Find the key that successes the given node.
*
* Parameters:
*
* node - the node to find the successor for
*
* Returns:
*
* the key of the node that successes the given node.
*
*/
successorNode = function (node) {
var parent;
if (node.rightChild.key !== null) {
return minNode(node.rightChild);
}
parent = node.parent;
while (parent.key !== null && node === parent.rightChild) {
node = parent;
parent = parent.parent;
}
return parent.key;
},
/*
* Private Method: predecessorNode
*
* Find the key that preceeds the given node.
*
* Parameters:
*
* node - the node to find the predecessor for
*
* Returns:
*
* the key of the node that preceeds the given node.
*
*/
predecessorNode = function (node) {
var parent;
if (node.leftChild.key !== null) {
return maxNode(node.leftChild);
}
parent = node.parent;
while (parent.key !== null && node === parent.leftChild) {
node = parent;
parent = parent.parent;
}
return parent.key;
},
deleteNode = function (node) {
// Deleting an empty root
if (node.parent === null) {
node.key = null;
node.value = null;
}
// Deleting a leaf
if (node.leftChild === null && node.rightChild === null) {
if (node.parent.leftChild === node) {
node.parent.leftChild = null;
node = null;
} else if (node.parent.rightChild === node) {
node.parent.rightChild = null;
node = null;
} else { // orphaned node
node = null;
}
}
// Deleting a node with one child
// Remove the node and replace it with its child
if ((node.leftChild === null && node.rightChild !== null) ||
(node.leftChild !== null && node.rightChild === null)) {
}
};
return {
/*
* Method: search
*
* Search through a binary tree.
*
* Parameters:
*
* key - the key to search for.
*
* Returns:
*
* the value of the found node,
* or null if no node was found,
* or undefined if no key was specified.
*
*/
search: function (key) {
var keyInt = parseInt(key, 10);
if (isNaN(keyInt)) {
return undefined; // key must be a number
} else {
return searchNode(root, keyInt);
}
},
/*
* Method: insert
*
* Insert into a binary tree.
*
* Parameters:
*
* key - the key to search for.
* value - the value to associate with the key (any type of
* object).
*
* Returns:
*
* true,
* or undefined if no key was specified.
*
*/
insert: function (key, value) {
var keyInt = parseInt(key, 10);
if (isNaN(keyInt)) {
return undefined; // key must be a number
} else {
return insertNode(root, keyInt, value, null);
}
},
/*
* Method: traverse
*
* Call a function on each node of a binary tree.
*
* Parameters:
*
* callback - the function to call on each node, this function
* takes a key and a value as parameters. If no
* callback is specified, print is called.
*
* Returns:
*
* true.
*
*/
traverse: function (callback) {
if (typeof callback === "undefined") {
callback = function (key, value) {
print(key + ": " + value);
};
}
return traverseNode(root, callback);
},
/*
* Method: min
*
* Find the key of the node with the lowest key number.
*
* Parameters:
*
* none
*
* Returns:
*
* the key of the node with the lowest key number.
*
*/
min: function () {
return minNode(root);
},
/*
* Method: max
*
* Find the key of the node with the highest key number.
*
* Parameters:
*
* none
*
* Returns:
*
* the key of the node with the highest key number.
*
*/
max: function () {
return maxNode(root);
},
/*
* Method: successor
*
* Find the key that successes the root node.
*
* Parameters:
*
* none
*
* Returns:
*
* the key of the node that successes the root node.
*
*/
successor: function () {
return successorNode(root);
},
/*
* Method: predecessor
*
* Find the key that preceeds the root node.
*
* Parameters:
*
* none
*
* Returns:
*
* the key of the node that preceeds the root node.
*
*/
predecessor: function () {
return predecessorNode(root);
},
/*
* Method: root
*
* The key of the root node.
*
* Parameters:
*
* none
*
* Returns:
*
* the key of the root node.
*
*/
root: function () {
return root.key;
}
};
},
/*
* Test Function: testBST
*
* Runs a series of tests on a binary search tree.
*
*/
testBST = function () {
var ipTree = new BST();
ipTree.insert(4, "test4");
ipTree.insert(1, "test1");
ipTree.insert(10, "test10");
ipTree.insert(2, "test2");
ipTree.insert(3, "test3");
ipTree.insert(9, "test9");
ipTree.insert(8, "test8");
ipTree.insert(5, "test5");
ipTree.insert(7, "test7");
ipTree.insert(6, "test6");
ipTree.traverse(function (key, value) {
print("The value of " + key + " is " + value + ".");
});
print("Searching for 3 results in: " + ipTree.search(3));
print("Min is " + ipTree.min());
print("Max is " + ipTree.max());
print("The successor of root is: " + ipTree.successor());
print("The root is: " + ipTree.root());
print("The predecessor of root is: " + ipTree.predecessor());
};
testBST(); // Run tests
/*
* License:
*
* Copyright (c) 2011 Trevor Lalish-Menagh.
* This software is licensed under the MIT License.
*
*/