npm - data-structure-typed - Versions diffs - 1.32.2 → 1.33.0 - Mend

data-structure-typed 1.32.2 → 1.33.0

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.

Files changed (252) hide show

package/.eslintrc.json +58 -0
package/.idea/data-structure-typed.iml +19 -0
package/.idea/inspectionProfiles/Project_Default.xml +6 -0
package/.idea/misc.xml +6 -0
package/.idea/modules.xml +8 -0
package/.idea/vcs.xml +6 -0
package/.prettierrc +16 -0
package/.travis.yml +17 -0
package/CHANGELOG.md +1 -1
package/README.md +366 -76
package/coverage/coverage-final.json +4 -4
package/docs/index.html +260 -9
package/package.json +50 -18
package/test/unit/data-structures/binary-tree/tree-multiset.test.ts +46 -1
package/.eslintrc.js +0 -61
package/.prettierrc.js +0 -16
package/coverage/clover.xml +0 -3393
package/coverage/lcov-report/base.css +0 -224
package/coverage/lcov-report/block-navigation.js +0 -87
package/coverage/lcov-report/favicon.png +0 -0
package/coverage/lcov-report/index.html +0 -386
package/coverage/lcov-report/prettify.css +0 -1
package/coverage/lcov-report/prettify.js +0 -2
package/coverage/lcov-report/sort-arrow-sprite.png +0 -0
package/coverage/lcov-report/sorter.js +0 -196
package/coverage/lcov-report/src/data-structures/binary-tree/aa-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/binary-tree/abstract-binary-tree.ts.html +0 -4978
package/coverage/lcov-report/src/data-structures/binary-tree/avl-tree.ts.html +0 -1015
package/coverage/lcov-report/src/data-structures/binary-tree/b-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/binary-tree/binary-indexed-tree.ts.html +0 -313
package/coverage/lcov-report/src/data-structures/binary-tree/binary-tree.ts.html +0 -226
package/coverage/lcov-report/src/data-structures/binary-tree/bst.ts.html +0 -1696
package/coverage/lcov-report/src/data-structures/binary-tree/index.html +0 -296
package/coverage/lcov-report/src/data-structures/binary-tree/index.ts.html +0 -121
package/coverage/lcov-report/src/data-structures/binary-tree/rb-tree.ts.html +0 -388
package/coverage/lcov-report/src/data-structures/binary-tree/segment-tree.ts.html +0 -811
package/coverage/lcov-report/src/data-structures/binary-tree/splay-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/binary-tree/tree-multiset.ts.html +0 -2185
package/coverage/lcov-report/src/data-structures/binary-tree/two-three-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/graph/abstract-graph.ts.html +0 -3205
package/coverage/lcov-report/src/data-structures/graph/directed-graph.ts.html +0 -1495
package/coverage/lcov-report/src/data-structures/graph/index.html +0 -176
package/coverage/lcov-report/src/data-structures/graph/index.ts.html +0 -97
package/coverage/lcov-report/src/data-structures/graph/map-graph.ts.html +0 -472
package/coverage/lcov-report/src/data-structures/graph/undirected-graph.ts.html +0 -907
package/coverage/lcov-report/src/data-structures/hash/coordinate-map.ts.html +0 -286
package/coverage/lcov-report/src/data-structures/hash/coordinate-set.ts.html +0 -253
package/coverage/lcov-report/src/data-structures/hash/hash-table.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/hash/index.html +0 -206
package/coverage/lcov-report/src/data-structures/hash/index.ts.html +0 -103
package/coverage/lcov-report/src/data-structures/hash/pair.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/hash/tree-map.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/hash/tree-set.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/heap/heap.ts.html +0 -721
package/coverage/lcov-report/src/data-structures/heap/index.html +0 -161
package/coverage/lcov-report/src/data-structures/heap/index.ts.html +0 -94
package/coverage/lcov-report/src/data-structures/heap/max-heap.ts.html +0 -178
package/coverage/lcov-report/src/data-structures/heap/min-heap.ts.html +0 -181
package/coverage/lcov-report/src/data-structures/index.html +0 -116
package/coverage/lcov-report/src/data-structures/index.ts.html +0 -118
package/coverage/lcov-report/src/data-structures/linked-list/doubly-linked-list.ts.html +0 -1804
package/coverage/lcov-report/src/data-structures/linked-list/index.html +0 -161
package/coverage/lcov-report/src/data-structures/linked-list/index.ts.html +0 -94
package/coverage/lcov-report/src/data-structures/linked-list/singly-linked-list.ts.html +0 -1588
package/coverage/lcov-report/src/data-structures/linked-list/skip-linked-list.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/matrix/index.html +0 -176
package/coverage/lcov-report/src/data-structures/matrix/index.ts.html +0 -97
package/coverage/lcov-report/src/data-structures/matrix/matrix.ts.html +0 -166
package/coverage/lcov-report/src/data-structures/matrix/matrix2d.ts.html +0 -721
package/coverage/lcov-report/src/data-structures/matrix/navigator.ts.html +0 -448
package/coverage/lcov-report/src/data-structures/matrix/vector2d.ts.html +0 -1033
package/coverage/lcov-report/src/data-structures/priority-queue/index.html +0 -161
package/coverage/lcov-report/src/data-structures/priority-queue/index.ts.html +0 -94
package/coverage/lcov-report/src/data-structures/priority-queue/max-priority-queue.ts.html +0 -253
package/coverage/lcov-report/src/data-structures/priority-queue/min-priority-queue.ts.html +0 -256
package/coverage/lcov-report/src/data-structures/priority-queue/priority-queue.ts.html +0 -1162
package/coverage/lcov-report/src/data-structures/queue/deque.ts.html +0 -976
package/coverage/lcov-report/src/data-structures/queue/index.html +0 -146
package/coverage/lcov-report/src/data-structures/queue/index.ts.html +0 -91
package/coverage/lcov-report/src/data-structures/queue/queue.ts.html +0 -658
package/coverage/lcov-report/src/data-structures/stack/index.html +0 -131
package/coverage/lcov-report/src/data-structures/stack/index.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/stack/stack.ts.html +0 -379
package/coverage/lcov-report/src/data-structures/tree/index.html +0 -131
package/coverage/lcov-report/src/data-structures/tree/index.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/tree/tree.ts.html +0 -292
package/coverage/lcov-report/src/data-structures/trie/index.html +0 -131
package/coverage/lcov-report/src/data-structures/trie/index.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/trie/trie.ts.html +0 -760
package/coverage/lcov-report/src/index.html +0 -116
package/coverage/lcov-report/src/index.ts.html +0 -97
package/coverage/lcov-report/src/interfaces/index.html +0 -116
package/coverage/lcov-report/src/interfaces/index.ts.html +0 -130
package/coverage/lcov-report/src/types/data-structures/abstract-binary-tree.ts.html +0 -235
package/coverage/lcov-report/src/types/data-structures/bst.ts.html +0 -124
package/coverage/lcov-report/src/types/data-structures/directed-graph.ts.html +0 -109
package/coverage/lcov-report/src/types/data-structures/index.html +0 -176
package/coverage/lcov-report/src/types/data-structures/index.ts.html +0 -130
package/coverage/lcov-report/src/types/data-structures/rb-tree.ts.html +0 -106
package/coverage/lcov-report/src/types/index.html +0 -116
package/coverage/lcov-report/src/types/index.ts.html +0 -94
package/coverage/lcov-report/src/types/utils/index.html +0 -116
package/coverage/lcov-report/src/types/utils/index.ts.html +0 -91
package/coverage/lcov-report/src/utils/index.html +0 -131
package/coverage/lcov-report/src/utils/index.ts.html +0 -88
package/coverage/lcov-report/src/utils/utils.ts.html +0 -322
package/coverage/lcov-report/test/utils/index.html +0 -146
package/coverage/lcov-report/test/utils/index.ts.html +0 -91
package/coverage/lcov-report/test/utils/magnitude.ts.html +0 -148
package/coverage/lcov-report/test/utils/number.ts.html +0 -94
package/coverage/lcov.info +0 -6676
package/docs/assets/highlight.css +0 -127
package/docs/assets/main.js +0 -58
package/docs/assets/search.js +0 -1
package/docs/assets/style.css +0 -1367
package/docs/classes/AVLTree.html +0 -2182
package/docs/classes/AVLTreeNode.html +0 -399
package/docs/classes/AaTree.html +0 -202
package/docs/classes/AbstractBinaryTree.html +0 -1836
package/docs/classes/AbstractBinaryTreeNode.html +0 -441
package/docs/classes/AbstractEdge.html +0 -345
package/docs/classes/AbstractGraph.html +0 -1105
package/docs/classes/AbstractVertex.html +0 -299
package/docs/classes/ArrayDeque.html +0 -469
package/docs/classes/BST.html +0 -2026
package/docs/classes/BSTNode.html +0 -400
package/docs/classes/BTree.html +0 -202
package/docs/classes/BinaryIndexedTree.html +0 -371
package/docs/classes/BinaryTree.html +0 -1867
package/docs/classes/BinaryTreeNode.html +0 -399
package/docs/classes/Character.html +0 -250
package/docs/classes/CoordinateMap.html +0 -513
package/docs/classes/CoordinateSet.html +0 -474
package/docs/classes/Deque.html +0 -1005
package/docs/classes/DirectedEdge.html +0 -404
package/docs/classes/DirectedGraph.html +0 -1530
package/docs/classes/DirectedVertex.html +0 -286
package/docs/classes/DoublyLinkedList.html +0 -998
package/docs/classes/DoublyLinkedListNode.html +0 -327
package/docs/classes/HashTable.html +0 -202
package/docs/classes/Heap.html +0 -647
package/docs/classes/HeapItem.html +0 -296
package/docs/classes/LinkedListQueue.html +0 -884
package/docs/classes/MapEdge.html +0 -391
package/docs/classes/MapGraph.html +0 -1583
package/docs/classes/MapVertex.html +0 -356
package/docs/classes/Matrix2D.html +0 -532
package/docs/classes/MatrixNTI2D.html +0 -270
package/docs/classes/MaxHeap.html +0 -671
package/docs/classes/MaxPriorityQueue.html +0 -866
package/docs/classes/MinHeap.html +0 -672
package/docs/classes/MinPriorityQueue.html +0 -868
package/docs/classes/Navigator.html +0 -343
package/docs/classes/ObjectDeque.html +0 -527
package/docs/classes/Pair.html +0 -202
package/docs/classes/PriorityQueue.html +0 -790
package/docs/classes/Queue.html +0 -521
package/docs/classes/RBTree.html +0 -2024
package/docs/classes/RBTreeNode.html +0 -431
package/docs/classes/SegmentTree.html +0 -464
package/docs/classes/SegmentTreeNode.html +0 -387
package/docs/classes/SinglyLinkedList.html +0 -830
package/docs/classes/SinglyLinkedListNode.html +0 -300
package/docs/classes/SkipLinkedList.html +0 -202
package/docs/classes/SplayTree.html +0 -202
package/docs/classes/Stack.html +0 -398
package/docs/classes/TreeMap.html +0 -202
package/docs/classes/TreeMultiset.html +0 -2510
package/docs/classes/TreeMultisetNode.html +0 -447
package/docs/classes/TreeNode.html +0 -344
package/docs/classes/TreeSet.html +0 -202
package/docs/classes/Trie.html +0 -402
package/docs/classes/TrieNode.html +0 -310
package/docs/classes/TwoThreeTree.html +0 -202
package/docs/classes/UndirectedEdge.html +0 -374
package/docs/classes/UndirectedGraph.html +0 -1285
package/docs/classes/UndirectedVertex.html +0 -284
package/docs/classes/Vector2D.html +0 -835
package/docs/enums/CP.html +0 -211
package/docs/enums/FamilyPosition.html +0 -239
package/docs/enums/LoopType.html +0 -212
package/docs/enums/RBColor.html +0 -204
package/docs/enums/TopologicalProperty.html +0 -211
package/docs/functions/arrayRemove.html +0 -208
package/docs/functions/isThunk.html +0 -186
package/docs/functions/toThunk.html +0 -186
package/docs/functions/trampoline.html +0 -186
package/docs/functions/trampolineAsync.html +0 -186
package/docs/functions/uuidV4.html +0 -181
package/docs/interfaces/IAVLTree.html +0 -1245
package/docs/interfaces/IAbstractBinaryTree.html +0 -1101
package/docs/interfaces/IAbstractBinaryTreeNode.html +0 -335
package/docs/interfaces/IAbstractGraph.html +0 -433
package/docs/interfaces/IBST.html +0 -1245
package/docs/interfaces/IDirectedGraph.html +0 -570
package/docs/interfaces/IRBTree.html +0 -1247
package/docs/interfaces/IUNDirectedGraph.html +0 -463
package/docs/types/AVLTreeNodeNested.html +0 -182
package/docs/types/AVLTreeOptions.html +0 -180
package/docs/types/AbstractBinaryTreeNodeNested.html +0 -182
package/docs/types/AbstractBinaryTreeNodeProperties.html +0 -182
package/docs/types/AbstractBinaryTreeNodeProperty.html +0 -182
package/docs/types/AbstractBinaryTreeOptions.html +0 -182
package/docs/types/BSTComparator.html +0 -192
package/docs/types/BSTNodeNested.html +0 -182
package/docs/types/BSTOptions.html +0 -182
package/docs/types/BinaryTreeDeletedResult.html +0 -189
package/docs/types/BinaryTreeNodeId.html +0 -177
package/docs/types/BinaryTreeNodeNested.html +0 -182
package/docs/types/BinaryTreeNodePropertyName.html +0 -177
package/docs/types/BinaryTreeOptions.html +0 -180
package/docs/types/DFSOrderPattern.html +0 -177
package/docs/types/DijkstraResult.html +0 -199
package/docs/types/Direction.html +0 -177
package/docs/types/DummyAny.html +0 -190
package/docs/types/EdgeId.html +0 -177
package/docs/types/HeapOptions.html +0 -198
package/docs/types/IAVLTreeNode.html +0 -184
package/docs/types/IBSTNode.html +0 -184
package/docs/types/IBinaryTree.html +0 -182
package/docs/types/IBinaryTreeNode.html +0 -184
package/docs/types/IRBTreeNode.html +0 -184
package/docs/types/ITreeMultiset.html +0 -182
package/docs/types/ITreeMultisetNode.html +0 -184
package/docs/types/KeyValueObject.html +0 -182
package/docs/types/KeyValueObjectWithId.html +0 -184
package/docs/types/MapGraphCoordinate.html +0 -177
package/docs/types/NavigatorParams.html +0 -211
package/docs/types/NodeOrPropertyName.html +0 -177
package/docs/types/NonNumberNonObjectButDefined.html +0 -177
package/docs/types/ObjectWithNonNumberId.html +0 -184
package/docs/types/ObjectWithNumberId.html +0 -184
package/docs/types/ObjectWithoutId.html +0 -177
package/docs/types/PriorityQueueComparator.html +0 -197
package/docs/types/PriorityQueueDFSOrderPattern.html +0 -177
package/docs/types/PriorityQueueOptions.html +0 -191
package/docs/types/RBTreeNodeNested.html +0 -182
package/docs/types/RBTreeOptions.html +0 -180
package/docs/types/RestrictValById.html +0 -177
package/docs/types/SegmentTreeNodeVal.html +0 -177
package/docs/types/SpecifyOptional.html +0 -184
package/docs/types/Thunk.html +0 -185
package/docs/types/ToThunkFn.html +0 -185
package/docs/types/TopologicalStatus.html +0 -177
package/docs/types/TreeMultisetNodeNested.html +0 -182
package/docs/types/TreeMultisetOptions.html +0 -180
package/docs/types/TrlAsyncFn.html +0 -190
package/docs/types/TrlFn.html +0 -190
package/docs/types/Turning.html +0 -177
package/docs/types/VertexId.html +0 -177
package/docs/variables/THUNK_SYMBOL.html +0 -177
/package/{CODE-OF-CONDUCT.md → CODE_OF_CONDUCT.md} +0 -0

package/docs/index.html CHANGED Viewed

@@ -18,17 +18,16 @@
 <img src="https://img.shields.io/badge/branches-97.54%25-brightgreen.svg?style=flat" alt="Branches">
 <img src="https://aleen42.github.io/badges/src/npm.svg" alt="npm">
 <img src="https://aleen42.github.io/badges/src/eslint.svg" alt="eslint"></p>
-<a id="md:brief" class="tsd-anchor"></a><h2><a href="#md:brief">Brief</a></h2><p>Data Structures of Javascript &amp; TypeScript.  </p>
-<a id="md:built-in-classic-algorithms" class="tsd-anchor"></a><h2><a href="#md:built-in-classic-algorithms">Built-in classic algorithms</a></h2><p>DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search),
-morris, Bellman-Ford Algorithm, Dijkstra&#39;s Algorithm, Floyd-Warshall Algorithm,
-Tarjan&#39;s Algorithm.</p>
+<a id="md:brief" class="tsd-anchor"></a><h2><a href="#md:brief">Brief</a></h2><p>Data Structures of Javascript &amp; TypeScript.</p>
+<a id="md:built-in-classic-algorithms" class="tsd-anchor"></a><h2><a href="#md:built-in-classic-algorithms">Built-in classic algorithms</a></h2><p>DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search), morris, Bellman-Ford Algorithm, Dijkstra&#39;s Algorithm,
+Floyd-Warshall Algorithm, Tarjan&#39;s Algorithm.</p>
 <a id="md:installation-and-usage" class="tsd-anchor"></a><h2><a href="#md:installation-and-usage">Installation and Usage</a></h2><a id="md:npm" class="tsd-anchor"></a><h3><a href="#md:npm">npm</a></h3><pre><code class="language-bash"><span class="hl-0">npm</span><span class="hl-1"> </span><span class="hl-2">install</span><span class="hl-1"> </span><span class="hl-2">data-structure-typed</span><span class="hl-1"> </span><span class="hl-3">--save</span>
 </code><button>Copy</button></pre>
 <a id="md:yarn" class="tsd-anchor"></a><h3><a href="#md:yarn">yarn</a></h3><pre><code class="language-bash"><span class="hl-0">yarn</span><span class="hl-1"> </span><span class="hl-2">add</span><span class="hl-1"> </span><span class="hl-2">data-structure-typed</span>
 </code><button>Copy</button></pre>
-<a id="md:cdn" class="tsd-anchor"></a><h3><a href="#md:cdn">CDN</a></h3><pre><code class="language-html"><span class="hl-4">&lt;</span><span class="hl-5">script</span><span class="hl-6"> </span><span class="hl-7">src</span><span class="hl-6">=</span><span class="hl-8">&quot;https://cdn.jsdelivr.net/npm/data-structure-typed/umd/bundle.min.js&quot;</span><span class="hl-4">&gt;&lt;/</span><span class="hl-5">script</span><span class="hl-4">&gt;</span>
+<a id="md:cdn" class="tsd-anchor"></a><h3><a href="#md:cdn">CDN</a></h3><pre><code class="language-html"><br/><span class="hl-4">&lt;</span><span class="hl-5">script</span><span class="hl-6"> </span><span class="hl-7">src</span><span class="hl-6">=</span><span class="hl-8">&quot;https://cdn.jsdelivr.net/npm/data-structure-typed/umd/bundle.min.js&quot;</span><span class="hl-4">&gt;&lt;/</span><span class="hl-5">script</span><span class="hl-4">&gt;</span>
 </code><button>Copy</button></pre>
-<pre><code class="language-js"><span class="hl-3">const</span><span class="hl-1"> {</span><span class="hl-9">AVLTree</span><span class="hl-1">} = </span><span class="hl-10">dataStructureTyped</span><span class="hl-1">;</span><br/><span class="hl-3">const</span><span class="hl-1"> {</span><span class="hl-9">Heap</span><span class="hl-1">, </span><span class="hl-9">MinHeap</span><span class="hl-1">, </span><span class="hl-9">SinglyLinkedList</span><span class="hl-1">, </span><span class="hl-9">Stack</span><span class="hl-1">, </span><span class="hl-9">AVLTreeNode</span><span class="hl-1">, </span><span class="hl-9">BST</span><span class="hl-1">, </span><span class="hl-9">Trie</span><span class="hl-1">, </span><span class="hl-9">DirectedGraph</span><span class="hl-1">, </span><span class="hl-9">DirectedVertex</span><span class="hl-1">, </span><span class="hl-9">TreeMultiset</span><span class="hl-1">} = </span><span class="hl-10">dataStructureTyped</span><span class="hl-1">;</span>
+<pre><code class="language-js"><span class="hl-3">const</span><span class="hl-1"> {</span><span class="hl-9">AVLTree</span><span class="hl-1">} = </span><span class="hl-10">dataStructureTyped</span><span class="hl-1">;</span><br/><span class="hl-3">const</span><span class="hl-1"> {</span><br/><span class="hl-1">  </span><span class="hl-9">Heap</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">MinHeap</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">SinglyLinkedList</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">Stack</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">AVLTreeNode</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">BST</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">Trie</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">DirectedGraph</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">DirectedVertex</span><span class="hl-1">,</span><br/><span class="hl-1">  </span><span class="hl-9">TreeMultiset</span><br/><span class="hl-1">} = </span><span class="hl-10">dataStructureTyped</span><span class="hl-1">;</span>
 </code><button>Copy</button></pre>
 <p><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/binary-tree-array-to-binary-tree.webp" alt="">
 <img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/binary-tree-dfs-in-order.webp" alt="">
@@ -40,9 +39,9 @@ Tarjan&#39;s Algorithm.</p>
 <a id="md:api-docs-amp-examples" class="tsd-anchor"></a><h2><a href="#md:api-docs-amp-examples">API docs &amp; Examples</a></h2><p><a href="https://data-structure-typed-docs.vercel.app">API Docs</a></p>
 <p><a href="https://vivid-algorithm.vercel.app">Live Examples</a></p>
 <p><a href="https://github.com/zrwusa/vivid-algorithm" target="_blank">Examples Repository</a></p>
-<a id="md:code-snippet" class="tsd-anchor"></a><h2><a href="#md:code-snippet">Code Snippet</a></h2><a id="md:binary-search-tree-bst-snippet" class="tsd-anchor"></a><h3><a href="#md:binary-search-tree-bst-snippet">Binary Search Tree (BST) snippet</a></h3><a id="md:ts" class="tsd-anchor"></a><h4><a href="#md:ts">TS</a></h4><pre><code class="language-ts"><span class="hl-1">    </span><span class="hl-11">import</span><span class="hl-1"> {</span><span class="hl-10">BST</span><span class="hl-1">, </span><span class="hl-10">BSTNode</span><span class="hl-1">} </span><span class="hl-11">from</span><span class="hl-1"> </span><span class="hl-2">&#39;data-structure-typed&#39;</span><span class="hl-1">;</span><br/><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">bst</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">();</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([</span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-12">5</span><span class="hl-1">]);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-10">size</span><span class="hl-1"> === </span><span class="hl-12">16</span><span class="hl-1">;                </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">has</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);                     </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">node6</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);       </span><span class="hl-13">// BSTNode</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">2</span><span class="hl-1">;         </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() === </span><span class="hl-12">5</span><span class="hl-1">;          </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getDepth</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">3</span><span class="hl-1">;          </span><span class="hl-13">// true</span><br/><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">()?.</span><span class="hl-10">id</span><span class="hl-1"> === </span><span class="hl-12">1</span><span class="hl-1">;    </span><span class="hl-13">// true</span><br/><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);                     </span><span class="hl-13">// null</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();            </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">()[</span><span class="hl-12">0</span><span class="hl-1">] === </span><span class="hl-12">11</span><span class="hl-1">;            </span><span class="hl-13">// true</span><br/><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">objBST</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">&lt;</span><span class="hl-14">BSTNode</span><span class="hl-1">&lt;{ </span><span class="hl-10">id</span><span class="hl-1">: </span><span class="hl-14">number</span><span class="hl-1">, </span><span class="hl-10">keyA</span><span class="hl-1">: </span><span class="hl-14">number</span><span class="hl-1"> }&gt;&gt;();</span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">});</span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">});</span><br/><span class="hl-1">    </span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([{</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">}]);</span><br/><span class="hl-1">    </span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span>
+<a id="md:code-snippet" class="tsd-anchor"></a><h2><a href="#md:code-snippet">Code Snippet</a></h2><a id="md:binary-search-tree-bst-snippet" class="tsd-anchor"></a><h3><a href="#md:binary-search-tree-bst-snippet">Binary Search Tree (BST) snippet</a></h3><a id="md:ts" class="tsd-anchor"></a><h4><a href="#md:ts">TS</a></h4><pre><code class="language-ts"><span class="hl-11">import</span><span class="hl-1"> {</span><span class="hl-10">BST</span><span class="hl-1">, </span><span class="hl-10">BSTNode</span><span class="hl-1">} </span><span class="hl-11">from</span><span class="hl-1"> </span><span class="hl-2">&#39;data-structure-typed&#39;</span><span class="hl-1">;</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">bst</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">();</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([</span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-12">5</span><span class="hl-1">]);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-10">size</span><span class="hl-1"> === </span><span class="hl-12">16</span><span class="hl-1">;                </span><span class="hl-13">// true</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">has</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);                     </span><span class="hl-13">// true</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">node6</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);       </span><span class="hl-13">// BSTNode</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">2</span><span class="hl-1">;         </span><span class="hl-13">// true</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() === </span><span class="hl-12">5</span><span class="hl-1">;          </span><span class="hl-13">// true</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getDepth</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">3</span><span class="hl-1">;          </span><span class="hl-13">// true</span><br/><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">()?.</span><span class="hl-10">id</span><span class="hl-1"> === </span><span class="hl-12">1</span><span class="hl-1">;    </span><span class="hl-13">// true</span><br/><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);                     </span><span class="hl-13">// null</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();            </span><span class="hl-13">// true</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">()[</span><span class="hl-12">0</span><span class="hl-1">] === </span><span class="hl-12">11</span><span class="hl-1">;            </span><span class="hl-13">// true</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">objBST</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">&lt;</span><span class="hl-14">BSTNode</span><span class="hl-1">&lt;{ </span><span class="hl-10">id</span><span class="hl-1">: </span><span class="hl-14">number</span><span class="hl-1">, </span><span class="hl-10">keyA</span><span class="hl-1">: </span><span class="hl-14">number</span><span class="hl-1"> }&gt;&gt;();</span><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">});</span><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">});</span><br/><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([{</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">}]);</span><br/><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span>
 </code><button>Copy</button></pre>
-<a id="md:js" class="tsd-anchor"></a><h4><a href="#md:js">JS</a></h4><pre><code class="language-js"><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> {</span><span class="hl-9">BST</span><span class="hl-1">, </span><span class="hl-9">BSTNode</span><span class="hl-1">} = </span><span class="hl-0">require</span><span class="hl-1">(</span><span class="hl-2">&#39;data-structure-typed&#39;</span><span class="hl-1">);</span><br/><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">bst</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">();</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([</span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-12">5</span><span class="hl-1">]);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-10">size</span><span class="hl-1"> === </span><span class="hl-12">16</span><span class="hl-1">;        </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">has</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);             </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">node6</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">2</span><span class="hl-1">; </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() === </span><span class="hl-12">5</span><span class="hl-1">;  </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getDepth</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">3</span><span class="hl-1">;  </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">leftMost</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">();</span><br/><span class="hl-1">    </span><span class="hl-10">leftMost</span><span class="hl-1">?.</span><span class="hl-10">id</span><span class="hl-1"> === </span><span class="hl-12">1</span><span class="hl-1">;     </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-0">expect</span><span class="hl-1">(</span><span class="hl-10">leftMost</span><span class="hl-1">?.</span><span class="hl-10">id</span><span class="hl-1">).</span><span class="hl-0">toBe</span><span class="hl-1">(</span><span class="hl-12">1</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);             </span><span class="hl-13">// null</span><br/><span class="hl-1">    </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true or false</span><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">bfsIDs</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">();</span><br/><span class="hl-1">    </span><span class="hl-10">bfsIDs</span><span class="hl-1">[</span><span class="hl-12">0</span><span class="hl-1">] === </span><span class="hl-12">11</span><span class="hl-1">;       </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-0">expect</span><span class="hl-1">(</span><span class="hl-10">bfsIDs</span><span class="hl-1">[</span><span class="hl-12">0</span><span class="hl-1">]).</span><span class="hl-0">toBe</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">objBST</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">();</span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">});</span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">});</span><br/><span class="hl-1">    </span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([{</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">},</span><br/><span class="hl-1">        {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">}]);</span><br/><span class="hl-1">    </span><br/><span class="hl-1">    </span><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><br/><span class="hl-1">    </span><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">avlTree</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">AVLTree</span><span class="hl-1">();</span><br/><span class="hl-1">    </span><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([</span><span class="hl-12">11</span><span class="hl-1">, </span><span class="hl-12">3</span><span class="hl-1">, </span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-12">5</span><span class="hl-1">])</span><br/><span class="hl-1">    </span><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true</span><br/><span class="hl-1">    </span><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">10</span><span class="hl-1">);</span><br/><span class="hl-1">    </span><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true</span>
+<a id="md:js" class="tsd-anchor"></a><h4><a href="#md:js">JS</a></h4><pre><code class="language-js"><span class="hl-3">const</span><span class="hl-1"> {</span><span class="hl-9">BST</span><span class="hl-1">, </span><span class="hl-9">BSTNode</span><span class="hl-1">} = </span><span class="hl-0">require</span><span class="hl-1">(</span><span class="hl-2">&#39;data-structure-typed&#39;</span><span class="hl-1">);</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">bst</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">();</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([</span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-12">5</span><span class="hl-1">]);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-10">size</span><span class="hl-1"> === </span><span class="hl-12">16</span><span class="hl-1">;        </span><span class="hl-13">// true</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">has</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);             </span><span class="hl-13">// true</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">node6</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">2</span><span class="hl-1">; </span><span class="hl-13">// true</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() === </span><span class="hl-12">5</span><span class="hl-1">;  </span><span class="hl-13">// true</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getDepth</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">) === </span><span class="hl-12">3</span><span class="hl-1">;  </span><span class="hl-13">// true</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">leftMost</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">();</span><br/><span class="hl-10">leftMost</span><span class="hl-1">?.</span><span class="hl-10">id</span><span class="hl-1"> === </span><span class="hl-12">1</span><span class="hl-1">;     </span><span class="hl-13">// true</span><br/><span class="hl-0">expect</span><span class="hl-1">(</span><span class="hl-10">leftMost</span><span class="hl-1">?.</span><span class="hl-10">id</span><span class="hl-1">).</span><span class="hl-0">toBe</span><span class="hl-1">(</span><span class="hl-12">1</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-12">6</span><span class="hl-1">);             </span><span class="hl-13">// null</span><br/><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true or false</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">bfsIDs</span><span class="hl-1"> = </span><span class="hl-10">bst</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">();</span><br/><span class="hl-10">bfsIDs</span><span class="hl-1">[</span><span class="hl-12">0</span><span class="hl-1">] === </span><span class="hl-12">11</span><span class="hl-1">;       </span><span class="hl-13">// true</span><br/><span class="hl-0">expect</span><span class="hl-1">(</span><span class="hl-10">bfsIDs</span><span class="hl-1">[</span><span class="hl-12">0</span><span class="hl-1">]).</span><span class="hl-0">toBe</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">objBST</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">BST</span><span class="hl-1">();</span><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">11</span><span class="hl-1">});</span><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">add</span><span class="hl-1">(</span><span class="hl-12">3</span><span class="hl-1">, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">3</span><span class="hl-1">});</span><br/><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([{</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">15</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">1</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">8</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">13</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">16</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">2</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">6</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">9</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">12</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">14</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">4</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">7</span><span class="hl-1">},</span><br/><span class="hl-1">  {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">10</span><span class="hl-1">}, {</span><span class="hl-10">id:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">, </span><span class="hl-10">keyA:</span><span class="hl-1"> </span><span class="hl-12">5</span><span class="hl-1">}]);</span><br/><br/><span class="hl-10">objBST</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">11</span><span class="hl-1">);</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">avlTree</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">AVLTree</span><span class="hl-1">();</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([</span><span class="hl-12">11</span><span class="hl-1">, </span><span class="hl-12">3</span><span class="hl-1">, </span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-12">5</span><span class="hl-1">])</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">10</span><span class="hl-1">);</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true</span>
 </code><button>Copy</button></pre>
 <a id="md:avltree-snippet" class="tsd-anchor"></a><h3><a href="#md:avltree-snippet">AVLTree snippet</a></h3><a id="md:ts-1" class="tsd-anchor"></a><h4><a href="#md:ts-1">TS</a></h4><pre><code class="language-ts"><span class="hl-11">import</span><span class="hl-1"> {</span><span class="hl-10">AVLTree</span><span class="hl-1">} </span><span class="hl-11">from</span><span class="hl-1"> </span><span class="hl-2">&#39;data-structure-typed&#39;</span><span class="hl-1">;</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-9">avlTree</span><span class="hl-1"> = </span><span class="hl-3">new</span><span class="hl-1"> </span><span class="hl-0">AVLTree</span><span class="hl-1">();</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">([</span><span class="hl-12">11</span><span class="hl-1">, </span><span class="hl-12">3</span><span class="hl-1">, </span><span class="hl-12">15</span><span class="hl-1">, </span><span class="hl-12">1</span><span class="hl-1">, </span><span class="hl-12">8</span><span class="hl-1">, </span><span class="hl-12">13</span><span class="hl-1">, </span><span class="hl-12">16</span><span class="hl-1">, </span><span class="hl-12">2</span><span class="hl-1">, </span><span class="hl-12">6</span><span class="hl-1">, </span><span class="hl-12">9</span><span class="hl-1">, </span><span class="hl-12">12</span><span class="hl-1">, </span><span class="hl-12">14</span><span class="hl-1">, </span><span class="hl-12">4</span><span class="hl-1">, </span><span class="hl-12">7</span><span class="hl-1">, </span><span class="hl-12">10</span><span class="hl-1">, </span><span class="hl-12">5</span><span class="hl-1">])</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-12">10</span><span class="hl-1">);</span><br/><span class="hl-10">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">();    </span><span class="hl-13">// true</span>
 </code><button>Copy</button></pre>
@@ -227,7 +226,9 @@ Tarjan&#39;s Algorithm.</p>
 </tbody>
 </table>
-<a id="md:code-design" class="tsd-anchor"></a><h2><a href="#md:code-design">Code design</a></h2><p>By strictly adhering to object-oriented design (BinaryTree -&gt; BST -&gt; AVLTree -&gt; TreeMultiset), you can seamlessly inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the optimal approach to data structure design.</p>
+<a id="md:code-design" class="tsd-anchor"></a><h2><a href="#md:code-design">Code design</a></h2><p>By strictly adhering to object-oriented design (BinaryTree -&gt; BST -&gt; AVLTree -&gt; TreeMultiset), you can seamlessly
+inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the
+optimal approach to data structure design.</p>
 <a id="md:complexities" class="tsd-anchor"></a><h2><a href="#md:complexities">Complexities</a></h2><a id="md:performance-of-big-o" class="tsd-anchor"></a><h3><a href="#md:performance-of-big-o">performance of Big O</a></h3><table>
 <thead>
 <tr>
@@ -481,6 +482,256 @@ Tarjan&#39;s Algorithm.</p>
 <td>k - length of longest key</td>
 </tr>
 </tbody>
+</table>
+<table>
+  <tr>
+    <th>Data Structure</th>
+    <th>C++ STL</th>
+    <th>java.util</th>
+    <th>Python collections</th>
+  </tr>
+  <tr>
+    <td>Dynamic Array (ArrayList)</td>
+    <td>std::vector&lt;T&gt;</td>
+    <td>ArrayList&lt;E&gt;</td>
+    <td>list</td>
+  </tr>
+  <tr>
+    <td>Linked List</td>
+    <td>std::list&lt;T&gt;</td>
+    <td>LinkedList&lt;E&gt;</td>
+    <td>deque</td>
+  </tr>
+  <tr>
+    <td>Set</td>
+    <td>std::set&lt;T&gt;</td>
+    <td>HashSet&lt;E&gt;</td>
+    <td>set</td>
+  </tr>
+  <tr>
+    <td>Map</td>
+    <td>std::map&lt;K, V&gt;</td>
+    <td>HashMap&lt;K, V&gt;</td>
+    <td>dict</td>
+  </tr>
+  <tr>
+    <td>Stack</td>
+    <td>std::stack&lt;T&gt;</td>
+    <td>Stack&lt;E&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Queue</td>
+    <td>std::queue&lt;T&gt;</td>
+    <td>LinkedList&lt;E&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Priority Queue</td>
+    <td>std::priority_queue&lt;T&gt;</td>
+    <td>PriorityQueue&lt;E&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Hash Table</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>defaultdict, Counter, etc.</td>
+  </tr>
+  <tr>
+    <td>Deque</td>
+    <td>std::deque&lt;T&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Multiset</td>
+    <td>std::multiset&lt;T&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Multimap</td>
+    <td>std::multimap&lt;K, V&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Unordered Set</td>
+    <td>std::unordered_set&lt;T&gt;</td>
+    <td>HashSet&lt;E&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Unordered Map</td>
+    <td>std::unordered_map&lt;K, V&gt;</td>
+    <td>HashMap&lt;K, V&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Bitset</td>
+    <td>std::bitset&lt;N&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Ordered Dictionary (OrderedDict)</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>OrderedDict</td>
+  </tr>
+  <tr>
+    <td>User-Defined Dictionary</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>UserDict</td>
+  </tr>
+  <tr>
+    <td>User-Defined List</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>UserList</td>
+  </tr>
+  <tr>
+    <td>User-Defined Set</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>UserSet</td>
+  </tr>
+  <tr>
+    <td>Double-Ended Queue (Deque)</td>
+    <td>std::deque&lt;T&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Skip List</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Circular Queue</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Bit Array</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Bloom Filter</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Linked Hash Set</td>
+    <td>N/A</td>
+    <td>LinkedHashSet&lt;E&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Linked Hash Map</td>
+    <td>N/A</td>
+    <td>LinkedHashMap&lt;K, V&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Sorted Set</td>
+    <td>N/A</td>
+    <td>TreeSet&lt;E&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Sorted Map</td>
+    <td>N/A</td>
+    <td>TreeMap&lt;K, V&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Tree Set</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Tree Map</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>Persistent Collections</td>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+<tr>
+    <td>std::unordered_multiset</td>
+    <td>std::unordered_multiset&lt;T&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>std::unordered_multimap</td>
+    <td>std::unordered_multimap&lt;K, V&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>TreeSet&lt;E&gt;</td>
+    <td>TreeSet&lt;E&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>TreeMap&lt;K, V&gt;</td>
+    <td>TreeMap&lt;K, V&gt;</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>LinkedBlockingQueue&lt;E&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>ConcurrentHashMap&lt;K, V&gt;</td>
+    <td>N/A</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>namedtuple</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>ChainMap</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>defaultdict</td>
+    <td>N/A</td>
+  </tr>
+  <tr>
+    <td>N/A</td>
+    <td>N/A</td>
+    <td>Counter</td>
+    <td>N/A</td>
+  </tr>
 </table></div></div>
 <div class="col-sidebar">
 <div class="page-menu">