bst-typed 1.34.4 → 1.34.6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/coverage/clover.xml +7 -3
- package/coverage/coverage-final.json +2 -1
- package/coverage/coverage-summary.json +2 -1
- package/coverage/lcov-report/index.html +25 -10
- package/coverage/lcov-report/index.ts.html +109 -0
- package/coverage/lcov.info +14 -0
- package/package.json +2 -2
- package/test/index.test.ts +378 -3
package/coverage/clover.xml
CHANGED
|
@@ -1,6 +1,10 @@
|
|
|
1
1
|
<?xml version="1.0" encoding="UTF-8"?>
|
|
2
|
-
<coverage generated="
|
|
3
|
-
<project timestamp="
|
|
4
|
-
<metrics statements="
|
|
2
|
+
<coverage generated="1696760530950" clover="3.2.0">
|
|
3
|
+
<project timestamp="1696760530951" name="All files">
|
|
4
|
+
<metrics statements="1" coveredstatements="1" conditionals="0" coveredconditionals="0" methods="2" coveredmethods="2" elements="3" coveredelements="3" complexity="0" loc="1" ncloc="1" packages="1" files="1" classes="1"/>
|
|
5
|
+
<file name="index.ts" path="/Users/revone/projects/data-structure-typed-individuals/bst-typed/src/index.ts">
|
|
6
|
+
<metrics statements="1" coveredstatements="1" conditionals="0" coveredconditionals="0" methods="2" coveredmethods="2"/>
|
|
7
|
+
<line num="8" count="7" type="stmt"/>
|
|
8
|
+
</file>
|
|
5
9
|
</project>
|
|
6
10
|
</coverage>
|
|
@@ -1 +1,2 @@
|
|
|
1
|
-
{}
|
|
1
|
+
{"/Users/revone/projects/data-structure-typed-individuals/bst-typed/src/index.ts": {"path":"/Users/revone/projects/data-structure-typed-individuals/bst-typed/src/index.ts","statementMap":{"0":{"start":{"line":8,"column":0},"end":{"line":8,"column":9}},"1":{"start":{"line":8,"column":9},"end":{"line":8,"column":18}},"2":{"start":{"line":8,"column":18},"end":{"line":8,"column":52}}},"fnMap":{"0":{"name":"(anonymous_0)","decl":{"start":{"line":8,"column":9},"end":{"line":8,"column":16}},"loc":{"start":{"line":8,"column":9},"end":{"line":8,"column":18}}},"1":{"name":"(anonymous_1)","decl":{"start":{"line":8,"column":18},"end":{"line":8,"column":21}},"loc":{"start":{"line":8,"column":18},"end":{"line":8,"column":52}}}},"branchMap":{},"s":{"0":1,"1":7,"2":5},"f":{"0":6,"1":4},"b":{}}
|
|
2
|
+
}
|
|
@@ -1,2 +1,3 @@
|
|
|
1
|
-
{"total": {"lines":{"total":
|
|
1
|
+
{"total": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"functions":{"total":2,"covered":2,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100},"branchesTrue":{"total":0,"covered":0,"skipped":0,"pct":"Unknown"}}
|
|
2
|
+
,"/Users/revone/projects/data-structure-typed-individuals/bst-typed/src/index.ts": {"lines":{"total":1,"covered":1,"skipped":0,"pct":100},"functions":{"total":2,"covered":2,"skipped":0,"pct":100},"statements":{"total":3,"covered":3,"skipped":0,"pct":100},"branches":{"total":0,"covered":0,"skipped":0,"pct":100}}
|
|
2
3
|
}
|
|
@@ -23,30 +23,30 @@
|
|
|
23
23
|
<div class='clearfix'>
|
|
24
24
|
|
|
25
25
|
<div class='fl pad1y space-right2'>
|
|
26
|
-
<span class="strong">
|
|
26
|
+
<span class="strong">100% </span>
|
|
27
27
|
<span class="quiet">Statements</span>
|
|
28
|
-
<span class='fraction'>
|
|
28
|
+
<span class='fraction'>3/3</span>
|
|
29
29
|
</div>
|
|
30
30
|
|
|
31
31
|
|
|
32
32
|
<div class='fl pad1y space-right2'>
|
|
33
|
-
<span class="strong">
|
|
33
|
+
<span class="strong">100% </span>
|
|
34
34
|
<span class="quiet">Branches</span>
|
|
35
35
|
<span class='fraction'>0/0</span>
|
|
36
36
|
</div>
|
|
37
37
|
|
|
38
38
|
|
|
39
39
|
<div class='fl pad1y space-right2'>
|
|
40
|
-
<span class="strong">
|
|
40
|
+
<span class="strong">100% </span>
|
|
41
41
|
<span class="quiet">Functions</span>
|
|
42
|
-
<span class='fraction'>
|
|
42
|
+
<span class='fraction'>2/2</span>
|
|
43
43
|
</div>
|
|
44
44
|
|
|
45
45
|
|
|
46
46
|
<div class='fl pad1y space-right2'>
|
|
47
|
-
<span class="strong">
|
|
47
|
+
<span class="strong">100% </span>
|
|
48
48
|
<span class="quiet">Lines</span>
|
|
49
|
-
<span class='fraction'>
|
|
49
|
+
<span class='fraction'>1/1</span>
|
|
50
50
|
</div>
|
|
51
51
|
|
|
52
52
|
|
|
@@ -61,7 +61,7 @@
|
|
|
61
61
|
</div>
|
|
62
62
|
</template>
|
|
63
63
|
</div>
|
|
64
|
-
<div class='status-line
|
|
64
|
+
<div class='status-line high'></div>
|
|
65
65
|
<div class="pad1">
|
|
66
66
|
<table class="coverage-summary">
|
|
67
67
|
<thead>
|
|
@@ -78,7 +78,22 @@
|
|
|
78
78
|
<th data-col="lines_raw" data-type="number" data-fmt="html" class="abs"></th>
|
|
79
79
|
</tr>
|
|
80
80
|
</thead>
|
|
81
|
-
<tbody
|
|
81
|
+
<tbody><tr>
|
|
82
|
+
<td class="file high" data-value="index.ts"><a href="index.ts.html">index.ts</a></td>
|
|
83
|
+
<td data-value="100" class="pic high">
|
|
84
|
+
<div class="chart"><div class="cover-fill cover-full" style="width: 100%"></div><div class="cover-empty" style="width: 0%"></div></div>
|
|
85
|
+
</td>
|
|
86
|
+
<td data-value="100" class="pct high">100%</td>
|
|
87
|
+
<td data-value="3" class="abs high">3/3</td>
|
|
88
|
+
<td data-value="100" class="pct high">100%</td>
|
|
89
|
+
<td data-value="0" class="abs high">0/0</td>
|
|
90
|
+
<td data-value="100" class="pct high">100%</td>
|
|
91
|
+
<td data-value="2" class="abs high">2/2</td>
|
|
92
|
+
<td data-value="100" class="pct high">100%</td>
|
|
93
|
+
<td data-value="1" class="abs high">1/1</td>
|
|
94
|
+
</tr>
|
|
95
|
+
|
|
96
|
+
</tbody>
|
|
82
97
|
</table>
|
|
83
98
|
</div>
|
|
84
99
|
<div class='push'></div><!-- for sticky footer -->
|
|
@@ -86,7 +101,7 @@
|
|
|
86
101
|
<div class='footer quiet pad2 space-top1 center small'>
|
|
87
102
|
Code coverage generated by
|
|
88
103
|
<a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
|
|
89
|
-
at 2023-10-
|
|
104
|
+
at 2023-10-08T10:22:10.967Z
|
|
90
105
|
</div>
|
|
91
106
|
<script src="prettify.js"></script>
|
|
92
107
|
<script>
|
|
@@ -0,0 +1,109 @@
|
|
|
1
|
+
|
|
2
|
+
<!doctype html>
|
|
3
|
+
<html lang="en">
|
|
4
|
+
|
|
5
|
+
<head>
|
|
6
|
+
<title>Code coverage report for index.ts</title>
|
|
7
|
+
<meta charset="utf-8" />
|
|
8
|
+
<link rel="stylesheet" href="prettify.css" />
|
|
9
|
+
<link rel="stylesheet" href="base.css" />
|
|
10
|
+
<link rel="shortcut icon" type="image/x-icon" href="favicon.png" />
|
|
11
|
+
<meta name="viewport" content="width=device-width, initial-scale=1" />
|
|
12
|
+
<style type='text/css'>
|
|
13
|
+
.coverage-summary .sorter {
|
|
14
|
+
background-image: url(sort-arrow-sprite.png);
|
|
15
|
+
}
|
|
16
|
+
</style>
|
|
17
|
+
</head>
|
|
18
|
+
|
|
19
|
+
<body>
|
|
20
|
+
<div class='wrapper'>
|
|
21
|
+
<div class='pad1'>
|
|
22
|
+
<h1><a href="index.html">All files</a> index.ts</h1>
|
|
23
|
+
<div class='clearfix'>
|
|
24
|
+
|
|
25
|
+
<div class='fl pad1y space-right2'>
|
|
26
|
+
<span class="strong">100% </span>
|
|
27
|
+
<span class="quiet">Statements</span>
|
|
28
|
+
<span class='fraction'>3/3</span>
|
|
29
|
+
</div>
|
|
30
|
+
|
|
31
|
+
|
|
32
|
+
<div class='fl pad1y space-right2'>
|
|
33
|
+
<span class="strong">100% </span>
|
|
34
|
+
<span class="quiet">Branches</span>
|
|
35
|
+
<span class='fraction'>0/0</span>
|
|
36
|
+
</div>
|
|
37
|
+
|
|
38
|
+
|
|
39
|
+
<div class='fl pad1y space-right2'>
|
|
40
|
+
<span class="strong">100% </span>
|
|
41
|
+
<span class="quiet">Functions</span>
|
|
42
|
+
<span class='fraction'>2/2</span>
|
|
43
|
+
</div>
|
|
44
|
+
|
|
45
|
+
|
|
46
|
+
<div class='fl pad1y space-right2'>
|
|
47
|
+
<span class="strong">100% </span>
|
|
48
|
+
<span class="quiet">Lines</span>
|
|
49
|
+
<span class='fraction'>1/1</span>
|
|
50
|
+
</div>
|
|
51
|
+
|
|
52
|
+
|
|
53
|
+
</div>
|
|
54
|
+
<p class="quiet">
|
|
55
|
+
Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
|
|
56
|
+
</p>
|
|
57
|
+
<template id="filterTemplate">
|
|
58
|
+
<div class="quiet">
|
|
59
|
+
Filter:
|
|
60
|
+
<input oninput="onInput()" type="search" id="fileSearch">
|
|
61
|
+
</div>
|
|
62
|
+
</template>
|
|
63
|
+
</div>
|
|
64
|
+
<div class='status-line high'></div>
|
|
65
|
+
<pre><table class="coverage">
|
|
66
|
+
<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
|
|
67
|
+
<a name='L2'></a><a href='#L2'>2</a>
|
|
68
|
+
<a name='L3'></a><a href='#L3'>3</a>
|
|
69
|
+
<a name='L4'></a><a href='#L4'>4</a>
|
|
70
|
+
<a name='L5'></a><a href='#L5'>5</a>
|
|
71
|
+
<a name='L6'></a><a href='#L6'>6</a>
|
|
72
|
+
<a name='L7'></a><a href='#L7'>7</a>
|
|
73
|
+
<a name='L8'></a><a href='#L8'>8</a>
|
|
74
|
+
<a name='L9'></a><a href='#L9'>9</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral"> </span>
|
|
75
|
+
<span class="cline-any cline-neutral"> </span>
|
|
76
|
+
<span class="cline-any cline-neutral"> </span>
|
|
77
|
+
<span class="cline-any cline-neutral"> </span>
|
|
78
|
+
<span class="cline-any cline-neutral"> </span>
|
|
79
|
+
<span class="cline-any cline-neutral"> </span>
|
|
80
|
+
<span class="cline-any cline-neutral"> </span>
|
|
81
|
+
<span class="cline-any cline-yes">7x</span>
|
|
82
|
+
<span class="cline-any cline-neutral"> </span></td><td class="text"><pre class="prettyprint lang-js">/**
|
|
83
|
+
* data-structure-typed
|
|
84
|
+
*
|
|
85
|
+
* @author Tyler Zeng
|
|
86
|
+
* @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
|
|
87
|
+
* @license MIT License
|
|
88
|
+
*/
|
|
89
|
+
export { BSTNode, BST } from 'data-structure-typed';
|
|
90
|
+
</pre></td></tr></table></pre>
|
|
91
|
+
|
|
92
|
+
<div class='push'></div><!-- for sticky footer -->
|
|
93
|
+
</div><!-- /wrapper -->
|
|
94
|
+
<div class='footer quiet pad2 space-top1 center small'>
|
|
95
|
+
Code coverage generated by
|
|
96
|
+
<a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
|
|
97
|
+
at 2023-10-08T10:22:10.967Z
|
|
98
|
+
</div>
|
|
99
|
+
<script src="prettify.js"></script>
|
|
100
|
+
<script>
|
|
101
|
+
window.onload = function () {
|
|
102
|
+
prettyPrint();
|
|
103
|
+
};
|
|
104
|
+
</script>
|
|
105
|
+
<script src="sorter.js"></script>
|
|
106
|
+
<script src="block-navigation.js"></script>
|
|
107
|
+
</body>
|
|
108
|
+
</html>
|
|
109
|
+
|
package/coverage/lcov.info
CHANGED
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "bst-typed",
|
|
3
|
-
"version": "1.34.
|
|
3
|
+
"version": "1.34.6",
|
|
4
4
|
"description": "BST (Binary Search Tree). Javascript & Typescript Data Structure.",
|
|
5
5
|
"main": "dist/index.js",
|
|
6
6
|
"scripts": {
|
|
@@ -143,6 +143,6 @@
|
|
|
143
143
|
"typescript": "^4.9.5"
|
|
144
144
|
},
|
|
145
145
|
"dependencies": {
|
|
146
|
-
"data-structure-typed": "^1.34.
|
|
146
|
+
"data-structure-typed": "^1.34.6"
|
|
147
147
|
}
|
|
148
148
|
}
|
package/test/index.test.ts
CHANGED
|
@@ -1,5 +1,380 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
|
|
1
|
+
import {BST, BSTNode} from '../src';
|
|
2
|
+
|
|
3
|
+
describe('BST operations test', () => {
|
|
4
|
+
it('should perform various operations on a Binary Search Tree with numeric values', () => {
|
|
5
|
+
const bst = new BST();
|
|
6
|
+
expect(bst).toBeInstanceOf(BST);
|
|
7
|
+
bst.add(11, 11);
|
|
8
|
+
bst.add(3, 3);
|
|
9
|
+
const idsAndValues = [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5];
|
|
10
|
+
bst.addMany(idsAndValues, idsAndValues);
|
|
11
|
+
expect(bst.root).toBeInstanceOf(BSTNode);
|
|
12
|
+
|
|
13
|
+
if (bst.root) expect(bst.root.id).toBe(11);
|
|
14
|
+
|
|
15
|
+
expect(bst.size).toBe(16);
|
|
16
|
+
|
|
17
|
+
expect(bst.has(6)).toBe(true);
|
|
18
|
+
|
|
19
|
+
const node6 = bst.get(6);
|
|
20
|
+
expect(node6 && bst.getHeight(6)).toBe(2);
|
|
21
|
+
expect(node6 && bst.getDepth(6)).toBe(3);
|
|
22
|
+
|
|
23
|
+
const nodeId10 = bst.get(10);
|
|
24
|
+
expect(nodeId10?.id).toBe(10);
|
|
25
|
+
|
|
26
|
+
const nodeVal9 = bst.get(9, 'val');
|
|
27
|
+
expect(nodeVal9?.id).toBe(9);
|
|
28
|
+
|
|
29
|
+
const leftMost = bst.getLeftMost();
|
|
30
|
+
expect(leftMost?.id).toBe(1);
|
|
31
|
+
|
|
32
|
+
const node15 = bst.get(15);
|
|
33
|
+
const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
|
|
34
|
+
expect(minNodeBySpecificNode?.id).toBe(12);
|
|
35
|
+
|
|
36
|
+
const subTreeSum = node15 && bst.subTreeSum(15);
|
|
37
|
+
expect(subTreeSum).toBe(70);
|
|
38
|
+
|
|
39
|
+
const lesserSum = bst.lesserSum(10);
|
|
40
|
+
expect(lesserSum).toBe(45);
|
|
41
|
+
|
|
42
|
+
expect(node15).toBeInstanceOf(BSTNode);
|
|
43
|
+
|
|
44
|
+
const node11 = bst.get(11);
|
|
45
|
+
expect(node11).toBeInstanceOf(BSTNode);
|
|
46
|
+
|
|
47
|
+
const dfsInorderNodes = bst.DFS('in', 'node');
|
|
48
|
+
expect(dfsInorderNodes[0].id).toBe(1);
|
|
49
|
+
expect(dfsInorderNodes[dfsInorderNodes.length - 1].id).toBe(16);
|
|
50
|
+
|
|
51
|
+
bst.perfectlyBalance();
|
|
52
|
+
expect(bst.isPerfectlyBalanced()).toBe(true);
|
|
53
|
+
|
|
54
|
+
const bfsNodesAfterBalanced = bst.BFS('node');
|
|
55
|
+
expect(bfsNodesAfterBalanced[0].id).toBe(8);
|
|
56
|
+
expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].id).toBe(16);
|
|
57
|
+
|
|
58
|
+
const removed11 = bst.remove(11);
|
|
59
|
+
expect(removed11).toBeInstanceOf(Array);
|
|
60
|
+
expect(removed11[0]).toBeDefined();
|
|
61
|
+
expect(removed11[0].deleted).toBeDefined();
|
|
62
|
+
|
|
63
|
+
if (removed11[0].deleted) expect(removed11[0].deleted.id).toBe(11);
|
|
64
|
+
|
|
65
|
+
expect(bst.isAVLBalanced()).toBe(true);
|
|
66
|
+
|
|
67
|
+
expect(bst.getHeight(15)).toBe(1);
|
|
68
|
+
|
|
69
|
+
const removed1 = bst.remove(1);
|
|
70
|
+
expect(removed1).toBeInstanceOf(Array);
|
|
71
|
+
expect(removed1[0]).toBeDefined();
|
|
72
|
+
expect(removed1[0].deleted).toBeDefined();
|
|
73
|
+
if (removed1[0].deleted) expect(removed1[0].deleted.id).toBe(1);
|
|
74
|
+
|
|
75
|
+
expect(bst.isAVLBalanced()).toBe(true);
|
|
76
|
+
|
|
77
|
+
expect(bst.getHeight()).toBe(4);
|
|
78
|
+
|
|
79
|
+
const removed4 = bst.remove(4);
|
|
80
|
+
expect(removed4).toBeInstanceOf(Array);
|
|
81
|
+
expect(removed4[0]).toBeDefined();
|
|
82
|
+
expect(removed4[0].deleted).toBeDefined();
|
|
83
|
+
if (removed4[0].deleted) expect(removed4[0].deleted.id).toBe(4);
|
|
84
|
+
expect(bst.isAVLBalanced()).toBe(true);
|
|
85
|
+
expect(bst.getHeight()).toBe(4);
|
|
86
|
+
|
|
87
|
+
const removed10 = bst.remove(10);
|
|
88
|
+
expect(removed10).toBeInstanceOf(Array);
|
|
89
|
+
expect(removed10[0]).toBeDefined();
|
|
90
|
+
expect(removed10[0].deleted).toBeDefined();
|
|
91
|
+
if (removed10[0].deleted) expect(removed10[0].deleted.id).toBe(10);
|
|
92
|
+
expect(bst.isAVLBalanced()).toBe(false);
|
|
93
|
+
expect(bst.getHeight()).toBe(4);
|
|
94
|
+
|
|
95
|
+
const removed15 = bst.remove(15);
|
|
96
|
+
expect(removed15).toBeInstanceOf(Array);
|
|
97
|
+
expect(removed15[0]).toBeDefined();
|
|
98
|
+
expect(removed15[0].deleted).toBeDefined();
|
|
99
|
+
if (removed15[0].deleted) expect(removed15[0].deleted.id).toBe(15);
|
|
100
|
+
|
|
101
|
+
expect(bst.isAVLBalanced()).toBe(true);
|
|
102
|
+
expect(bst.getHeight()).toBe(3);
|
|
103
|
+
|
|
104
|
+
const removed5 = bst.remove(5);
|
|
105
|
+
expect(removed5).toBeInstanceOf(Array);
|
|
106
|
+
expect(removed5[0]).toBeDefined();
|
|
107
|
+
expect(removed5[0].deleted).toBeDefined();
|
|
108
|
+
if (removed5[0].deleted) expect(removed5[0].deleted.id).toBe(5);
|
|
109
|
+
|
|
110
|
+
expect(bst.isAVLBalanced()).toBe(true);
|
|
111
|
+
expect(bst.getHeight()).toBe(3);
|
|
112
|
+
|
|
113
|
+
const removed13 = bst.remove(13);
|
|
114
|
+
expect(removed13).toBeInstanceOf(Array);
|
|
115
|
+
expect(removed13[0]).toBeDefined();
|
|
116
|
+
expect(removed13[0].deleted).toBeDefined();
|
|
117
|
+
if (removed13[0].deleted) expect(removed13[0].deleted.id).toBe(13);
|
|
118
|
+
expect(bst.isAVLBalanced()).toBe(true);
|
|
119
|
+
expect(bst.getHeight()).toBe(3);
|
|
120
|
+
|
|
121
|
+
const removed3 = bst.remove(3);
|
|
122
|
+
expect(removed3).toBeInstanceOf(Array);
|
|
123
|
+
expect(removed3[0]).toBeDefined();
|
|
124
|
+
expect(removed3[0].deleted).toBeDefined();
|
|
125
|
+
if (removed3[0].deleted) expect(removed3[0].deleted.id).toBe(3);
|
|
126
|
+
expect(bst.isAVLBalanced()).toBe(false);
|
|
127
|
+
expect(bst.getHeight()).toBe(3);
|
|
128
|
+
|
|
129
|
+
const removed8 = bst.remove(8);
|
|
130
|
+
expect(removed8).toBeInstanceOf(Array);
|
|
131
|
+
expect(removed8[0]).toBeDefined();
|
|
132
|
+
expect(removed8[0].deleted).toBeDefined();
|
|
133
|
+
if (removed8[0].deleted) expect(removed8[0].deleted.id).toBe(8);
|
|
134
|
+
expect(bst.isAVLBalanced()).toBe(true);
|
|
135
|
+
expect(bst.getHeight()).toBe(3);
|
|
136
|
+
|
|
137
|
+
const removed6 = bst.remove(6);
|
|
138
|
+
expect(removed6).toBeInstanceOf(Array);
|
|
139
|
+
expect(removed6[0]).toBeDefined();
|
|
140
|
+
expect(removed6[0].deleted).toBeDefined();
|
|
141
|
+
if (removed6[0].deleted) expect(removed6[0].deleted.id).toBe(6);
|
|
142
|
+
expect(bst.remove(6).length).toBe(0);
|
|
143
|
+
expect(bst.isAVLBalanced()).toBe(false);
|
|
144
|
+
expect(bst.getHeight()).toBe(3);
|
|
145
|
+
|
|
146
|
+
const removed7 = bst.remove(7);
|
|
147
|
+
expect(removed7).toBeInstanceOf(Array);
|
|
148
|
+
expect(removed7[0]).toBeDefined();
|
|
149
|
+
expect(removed7[0].deleted).toBeDefined();
|
|
150
|
+
if (removed7[0].deleted) expect(removed7[0].deleted.id).toBe(7);
|
|
151
|
+
expect(bst.isAVLBalanced()).toBe(false);
|
|
152
|
+
expect(bst.getHeight()).toBe(3);
|
|
153
|
+
|
|
154
|
+
const removed9 = bst.remove(9);
|
|
155
|
+
expect(removed9).toBeInstanceOf(Array);
|
|
156
|
+
expect(removed9[0]).toBeDefined();
|
|
157
|
+
expect(removed9[0].deleted).toBeDefined();
|
|
158
|
+
if (removed9[0].deleted) expect(removed9[0].deleted.id).toBe(9);
|
|
159
|
+
expect(bst.isAVLBalanced()).toBe(false);
|
|
160
|
+
expect(bst.getHeight()).toBe(3);
|
|
161
|
+
|
|
162
|
+
const removed14 = bst.remove(14);
|
|
163
|
+
expect(removed14).toBeInstanceOf(Array);
|
|
164
|
+
expect(removed14[0]).toBeDefined();
|
|
165
|
+
expect(removed14[0].deleted).toBeDefined();
|
|
166
|
+
if (removed14[0].deleted) expect(removed14[0].deleted.id).toBe(14);
|
|
167
|
+
expect(bst.isAVLBalanced()).toBe(false);
|
|
168
|
+
expect(bst.getHeight()).toBe(2);
|
|
169
|
+
|
|
170
|
+
expect(bst.isAVLBalanced()).toBe(false);
|
|
171
|
+
|
|
172
|
+
const bfsIDs = bst.BFS();
|
|
173
|
+
expect(bfsIDs[0]).toBe(2);
|
|
174
|
+
expect(bfsIDs[1]).toBe(12);
|
|
175
|
+
expect(bfsIDs[2]).toBe(16);
|
|
176
|
+
|
|
177
|
+
const bfsNodes = bst.BFS('node');
|
|
178
|
+
expect(bfsNodes[0].id).toBe(2);
|
|
179
|
+
expect(bfsNodes[1].id).toBe(12);
|
|
180
|
+
expect(bfsNodes[2].id).toBe(16);
|
|
181
|
+
});
|
|
182
|
+
|
|
183
|
+
it('should perform various operations on a Binary Search Tree with object values', () => {
|
|
184
|
+
const objBST = new BST<BSTNode<{id: number; keyA: number}>>();
|
|
185
|
+
expect(objBST).toBeInstanceOf(BST);
|
|
186
|
+
objBST.add(11, {id: 11, keyA: 11});
|
|
187
|
+
objBST.add(3, {id: 3, keyA: 3});
|
|
188
|
+
const values = [
|
|
189
|
+
{id: 15, keyA: 15},
|
|
190
|
+
{id: 1, keyA: 1},
|
|
191
|
+
{id: 8, keyA: 8},
|
|
192
|
+
{id: 13, keyA: 13},
|
|
193
|
+
{id: 16, keyA: 16},
|
|
194
|
+
{id: 2, keyA: 2},
|
|
195
|
+
{id: 6, keyA: 6},
|
|
196
|
+
{id: 9, keyA: 9},
|
|
197
|
+
{id: 12, keyA: 12},
|
|
198
|
+
{id: 14, keyA: 14},
|
|
199
|
+
{id: 4, keyA: 4},
|
|
200
|
+
{id: 7, keyA: 7},
|
|
201
|
+
{id: 10, keyA: 10},
|
|
202
|
+
{id: 5, keyA: 5}
|
|
203
|
+
];
|
|
204
|
+
|
|
205
|
+
objBST.addMany(
|
|
206
|
+
values.map(item => item.id),
|
|
207
|
+
values
|
|
208
|
+
);
|
|
209
|
+
|
|
210
|
+
expect(objBST.root).toBeInstanceOf(BSTNode);
|
|
211
|
+
|
|
212
|
+
if (objBST.root) expect(objBST.root.id).toBe(11);
|
|
213
|
+
|
|
214
|
+
expect(objBST.has(6)).toBe(true);
|
|
215
|
+
|
|
216
|
+
const node6 = objBST.get(6);
|
|
217
|
+
expect(node6 && objBST.getHeight(node6)).toBe(2);
|
|
218
|
+
expect(node6 && objBST.getDepth(node6)).toBe(3);
|
|
219
|
+
|
|
220
|
+
const nodeId10 = objBST.get(10, 'id');
|
|
221
|
+
expect(nodeId10?.id).toBe(10);
|
|
222
|
+
|
|
223
|
+
const nodeVal9 = objBST.get(9, 'id');
|
|
224
|
+
expect(nodeVal9?.id).toBe(9);
|
|
225
|
+
|
|
226
|
+
const leftMost = objBST.getLeftMost();
|
|
227
|
+
expect(leftMost?.id).toBe(1);
|
|
228
|
+
|
|
229
|
+
const node15 = objBST.get(15);
|
|
230
|
+
expect(node15?.val).toEqual({id: 15, keyA: 15});
|
|
231
|
+
const minNodeBySpecificNode = node15 && objBST.getLeftMost(node15);
|
|
232
|
+
expect(minNodeBySpecificNode?.id).toBe(12);
|
|
233
|
+
|
|
234
|
+
const subTreeSum = node15 && objBST.subTreeSum(node15);
|
|
235
|
+
expect(subTreeSum).toBe(70);
|
|
236
|
+
|
|
237
|
+
const lesserSum = objBST.lesserSum(10);
|
|
238
|
+
expect(lesserSum).toBe(45);
|
|
239
|
+
|
|
240
|
+
expect(node15).toBeInstanceOf(BSTNode);
|
|
241
|
+
|
|
242
|
+
const node11 = objBST.get(11);
|
|
243
|
+
expect(node11).toBeInstanceOf(BSTNode);
|
|
244
|
+
|
|
245
|
+
const dfsInorderNodes = objBST.DFS('in', 'node');
|
|
246
|
+
expect(dfsInorderNodes[0].id).toBe(1);
|
|
247
|
+
expect(dfsInorderNodes[dfsInorderNodes.length - 1].id).toBe(16);
|
|
248
|
+
|
|
249
|
+
objBST.perfectlyBalance();
|
|
250
|
+
expect(objBST.isPerfectlyBalanced()).toBe(true);
|
|
251
|
+
|
|
252
|
+
const bfsNodesAfterBalanced = objBST.BFS('node');
|
|
253
|
+
expect(bfsNodesAfterBalanced[0].id).toBe(8);
|
|
254
|
+
expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].id).toBe(16);
|
|
255
|
+
|
|
256
|
+
const removed11 = objBST.remove(11);
|
|
257
|
+
expect(removed11).toBeInstanceOf(Array);
|
|
258
|
+
expect(removed11[0]).toBeDefined();
|
|
259
|
+
expect(removed11[0].deleted).toBeDefined();
|
|
260
|
+
|
|
261
|
+
if (removed11[0].deleted) expect(removed11[0].deleted.id).toBe(11);
|
|
262
|
+
|
|
263
|
+
expect(objBST.isAVLBalanced()).toBe(true);
|
|
264
|
+
|
|
265
|
+
expect(node15 && objBST.getHeight(node15)).toBe(2);
|
|
266
|
+
|
|
267
|
+
const removed1 = objBST.remove(1);
|
|
268
|
+
expect(removed1).toBeInstanceOf(Array);
|
|
269
|
+
expect(removed1[0]).toBeDefined();
|
|
270
|
+
expect(removed1[0].deleted).toBeDefined();
|
|
271
|
+
if (removed1[0].deleted) expect(removed1[0].deleted.id).toBe(1);
|
|
272
|
+
|
|
273
|
+
expect(objBST.isAVLBalanced()).toBe(true);
|
|
274
|
+
|
|
275
|
+
expect(objBST.getHeight()).toBe(4);
|
|
276
|
+
|
|
277
|
+
const removed4 = objBST.remove(4);
|
|
278
|
+
expect(removed4).toBeInstanceOf(Array);
|
|
279
|
+
expect(removed4[0]).toBeDefined();
|
|
280
|
+
expect(removed4[0].deleted).toBeDefined();
|
|
281
|
+
if (removed4[0].deleted) expect(removed4[0].deleted.id).toBe(4);
|
|
282
|
+
expect(objBST.isAVLBalanced()).toBe(true);
|
|
283
|
+
expect(objBST.getHeight()).toBe(4);
|
|
284
|
+
|
|
285
|
+
const removed10 = objBST.remove(10);
|
|
286
|
+
expect(removed10).toBeInstanceOf(Array);
|
|
287
|
+
expect(removed10[0]).toBeDefined();
|
|
288
|
+
expect(removed10[0].deleted).toBeDefined();
|
|
289
|
+
if (removed10[0].deleted) expect(removed10[0].deleted.id).toBe(10);
|
|
290
|
+
expect(objBST.isAVLBalanced()).toBe(false);
|
|
291
|
+
expect(objBST.getHeight()).toBe(4);
|
|
292
|
+
|
|
293
|
+
const removed15 = objBST.remove(15);
|
|
294
|
+
expect(removed15).toBeInstanceOf(Array);
|
|
295
|
+
expect(removed15[0]).toBeDefined();
|
|
296
|
+
expect(removed15[0].deleted).toBeDefined();
|
|
297
|
+
if (removed15[0].deleted) expect(removed15[0].deleted.id).toBe(15);
|
|
298
|
+
|
|
299
|
+
expect(objBST.isAVLBalanced()).toBe(true);
|
|
300
|
+
expect(objBST.getHeight()).toBe(3);
|
|
301
|
+
|
|
302
|
+
const removed5 = objBST.remove(5);
|
|
303
|
+
expect(removed5).toBeInstanceOf(Array);
|
|
304
|
+
expect(removed5[0]).toBeDefined();
|
|
305
|
+
expect(removed5[0].deleted).toBeDefined();
|
|
306
|
+
if (removed5[0].deleted) expect(removed5[0].deleted.id).toBe(5);
|
|
307
|
+
|
|
308
|
+
expect(objBST.isAVLBalanced()).toBe(true);
|
|
309
|
+
expect(objBST.getHeight()).toBe(3);
|
|
310
|
+
|
|
311
|
+
const removed13 = objBST.remove(13);
|
|
312
|
+
expect(removed13).toBeInstanceOf(Array);
|
|
313
|
+
expect(removed13[0]).toBeDefined();
|
|
314
|
+
expect(removed13[0].deleted).toBeDefined();
|
|
315
|
+
if (removed13[0].deleted) expect(removed13[0].deleted.id).toBe(13);
|
|
316
|
+
expect(objBST.isAVLBalanced()).toBe(true);
|
|
317
|
+
expect(objBST.getHeight()).toBe(3);
|
|
318
|
+
|
|
319
|
+
const removed3 = objBST.remove(3);
|
|
320
|
+
expect(removed3).toBeInstanceOf(Array);
|
|
321
|
+
expect(removed3[0]).toBeDefined();
|
|
322
|
+
expect(removed3[0].deleted).toBeDefined();
|
|
323
|
+
if (removed3[0].deleted) expect(removed3[0].deleted.id).toBe(3);
|
|
324
|
+
expect(objBST.isAVLBalanced()).toBe(false);
|
|
325
|
+
expect(objBST.getHeight()).toBe(3);
|
|
326
|
+
|
|
327
|
+
const removed8 = objBST.remove(8);
|
|
328
|
+
expect(removed8).toBeInstanceOf(Array);
|
|
329
|
+
expect(removed8[0]).toBeDefined();
|
|
330
|
+
expect(removed8[0].deleted).toBeDefined();
|
|
331
|
+
if (removed8[0].deleted) expect(removed8[0].deleted.id).toBe(8);
|
|
332
|
+
expect(objBST.isAVLBalanced()).toBe(true);
|
|
333
|
+
expect(objBST.getHeight()).toBe(3);
|
|
334
|
+
|
|
335
|
+
const removed6 = objBST.remove(6);
|
|
336
|
+
expect(removed6).toBeInstanceOf(Array);
|
|
337
|
+
expect(removed6[0]).toBeDefined();
|
|
338
|
+
expect(removed6[0].deleted).toBeDefined();
|
|
339
|
+
if (removed6[0].deleted) expect(removed6[0].deleted.id).toBe(6);
|
|
340
|
+
expect(objBST.remove(6).length).toBe(0);
|
|
341
|
+
expect(objBST.isAVLBalanced()).toBe(false);
|
|
342
|
+
expect(objBST.getHeight()).toBe(3);
|
|
343
|
+
|
|
344
|
+
const removed7 = objBST.remove(7);
|
|
345
|
+
expect(removed7).toBeInstanceOf(Array);
|
|
346
|
+
expect(removed7[0]).toBeDefined();
|
|
347
|
+
expect(removed7[0].deleted).toBeDefined();
|
|
348
|
+
if (removed7[0].deleted) expect(removed7[0].deleted.id).toBe(7);
|
|
349
|
+
expect(objBST.isAVLBalanced()).toBe(false);
|
|
350
|
+
expect(objBST.getHeight()).toBe(3);
|
|
351
|
+
|
|
352
|
+
const removed9 = objBST.remove(9);
|
|
353
|
+
expect(removed9).toBeInstanceOf(Array);
|
|
354
|
+
expect(removed9[0]).toBeDefined();
|
|
355
|
+
expect(removed9[0].deleted).toBeDefined();
|
|
356
|
+
if (removed9[0].deleted) expect(removed9[0].deleted.id).toBe(9);
|
|
357
|
+
expect(objBST.isAVLBalanced()).toBe(false);
|
|
358
|
+
expect(objBST.getHeight()).toBe(3);
|
|
359
|
+
|
|
360
|
+
const removed14 = objBST.remove(14);
|
|
361
|
+
expect(removed14).toBeInstanceOf(Array);
|
|
362
|
+
expect(removed14[0]).toBeDefined();
|
|
363
|
+
expect(removed14[0].deleted).toBeDefined();
|
|
364
|
+
if (removed14[0].deleted) expect(removed14[0].deleted.id).toBe(14);
|
|
365
|
+
expect(objBST.isAVLBalanced()).toBe(false);
|
|
366
|
+
expect(objBST.getHeight()).toBe(2);
|
|
367
|
+
|
|
368
|
+
expect(objBST.isAVLBalanced()).toBe(false);
|
|
369
|
+
|
|
370
|
+
const bfsIDs = objBST.BFS();
|
|
371
|
+
expect(bfsIDs[0]).toBe(2);
|
|
372
|
+
expect(bfsIDs[1]).toBe(12);
|
|
373
|
+
expect(bfsIDs[2]).toBe(16);
|
|
374
|
+
|
|
375
|
+
const bfsNodes = objBST.BFS('node');
|
|
376
|
+
expect(bfsNodes[0].id).toBe(2);
|
|
377
|
+
expect(bfsNodes[1].id).toBe(12);
|
|
378
|
+
expect(bfsNodes[2].id).toBe(16);
|
|
4
379
|
});
|
|
5
380
|
});
|