forked from loiane/javascript-datastructures-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbinary-search-tree.spec.ts
109 lines (83 loc) · 2.44 KB
/
binary-search-tree.spec.ts
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
import 'mocha';
import { expect } from 'chai';
import { BinarySearchTree } from '../../../src/ts/index';
describe('BinarySearchTree', () => {
let tree: BinarySearchTree<number>;
beforeEach(() => {
tree = new BinarySearchTree<number>();
});
it('starts empty', () => {
expect(tree.getRoot()).to.equal(undefined);
});
function assertNode(node: any, key: number, left: number, right: number) {
if (key != null) {
expect(node.key).to.equal(key);
} else {
expect(node).to.equal(key);
return;
}
if (left != null) {
expect(node.left.key).to.equal(left);
} else {
expect(node.left).to.equal(left);
}
if (right != null) {
expect(node.right.key).to.equal(right);
} else {
expect(node.right).to.equal(right);
}
}
it('inserts elements in the BST', () => {
expect(tree.getRoot()).to.equal(undefined);
tree.insert(11);
tree.insert(7);
tree.insert(15);
tree.insert(5);
tree.insert(3);
tree.insert(9);
tree.insert(8);
tree.insert(10);
tree.insert(13);
tree.insert(12);
tree.insert(14);
tree.insert(20);
tree.insert(18);
tree.insert(25);
let node = tree.getRoot();
assertNode(node, 11, 7, 15);
node = node.left;
assertNode(node, 7, 5, 9);
node = node.left;
assertNode(node, 5, 3, undefined);
node = node.left;
assertNode(node, 3, undefined, undefined);
node = tree.getRoot().left.left.right;
assertNode(node, undefined, undefined, undefined);
node = tree.getRoot().left.right;
assertNode(node, 9, 8, 10);
node = node.left;
assertNode(node, 8, undefined, undefined);
node = tree.getRoot().left.right.right;
assertNode(node, 10, undefined, undefined);
node = tree.getRoot().right;
assertNode(node, 15, 13, 20);
node = node.left;
assertNode(node, 13, 12, 14);
node = node.left;
assertNode(node, 12, undefined, undefined);
node = tree.getRoot().right.left.right;
assertNode(node, 14, undefined, undefined);
node = tree.getRoot().right.right;
assertNode(node, 20, 18, 25);
node = node.left;
assertNode(node, 18, undefined, undefined);
node = tree.getRoot().right.right.right;
assertNode(node, 25, undefined, undefined);
});
it('verifies if element exists', () => {
expect(tree.getRoot()).to.equal(undefined);
});
it('removes a leaf', () => {
expect(tree.getRoot()).to.equal(undefined);
});
});