bst-typed 1.19.45 → 1.20.0

package/README.md

@@ -1,179 +1,328 @@
 # What
-
 ## Brief
-Javascript & TypeScript Data Structure Library. 
-
-Binary Tree, Binary Search Tree (BST), AVL Tree, Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Linked List, Singly Linked List, Doubly Linked List, Queue, Object Deque, Array Deque, Stack, Hash, Coordinate Set, Coordinate Map, Heap, Priority Queue, Max Priority Queue, Min Priority Queue, Trie
-
-## Algorithms list only a few out, you can discover more in API docs
-
-DFS, DFSIterative, BFS, morris, Bellman-Ford Algorithm, Dijkstra's Algorithm, Floyd-Warshall Algorithm, Tarjan's Algorithm
+This is a standalone BST (Binary Search Tree) data structure from the data-structure-typed collection. If you wish to access more data structures or advanced features, you can transition to directly installing the complete [data-structure-typed](https://www.npmjs.com/package/data-structure-typed) package
 
-## Code design
-By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> 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.
 
 # How
 
 ## install
+### npm
+```bash
+npm i bst-typed
+```
 ### yarn
-
 ```bash
-yarn add data-structure-typed
+yarn add bst-typed
 ```
+### methods
+![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/methods-8bit/bst.png?raw=true)
+### snippet
+#### TS
+```typescript
+import {BST, BSTNode} from 'data-structure-typed';
+// /* or if you prefer */ import {BST, BSTNode} from 'bst-typed';
 
-### npm
+const bst = new BST();
+bst instanceof BST;                    // true
+bst.add(11);
+bst.add(3);
+const idsAndValues = [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5];
+bst.addMany(idsAndValues);
+bst.root instanceof BSTNode;           // true
 
-```bash
-npm install data-structure-typed
-```
+if (bst.root) bst.root.id;             // 11
 
-### Binary Search Tree (BST) snippet
+bst.size;                              // 16
 
-#### TS
-```typescript
-    import {BST, BSTNode} from 'data-structure-typed';
-
-    const bst = new BST();
-    bst.add(11);
-    bst.add(3);
-    bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
-    bst.size === 16;        // true
-    bst.has(6);             // true
-    const node6 = bst.get(6);
-    bst.getHeight(6) === 2; // true
-    bst.getHeight() === 5;  // true
-    bst.getDepth(6) === 3;  // true
-    const leftMost = bst.getLeftMost();
-    leftMost?.id === 1;     // true
-    expect(leftMost?.id).toBe(1);
-    bst.remove(6);
-    bst.get(6);             // null
-    bst.isAVLBalanced();    // true or false
-    const bfsIDs = bst.BFS();
-    bfsIDs[0] === 11;   // true
-    expect(bfsIDs[0]).toBe(11);
-    
-    const objBST = new BST<BSTNode<{ id: number, keyA: number }>>();
-    objBST.add(11, {id: 11, keyA: 11});
-    objBST.add(3, {id: 3, keyA: 3});
-    
-    objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
-        {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
-        {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
-        {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
-        {id: 10, keyA: 10}, {id: 5, keyA: 5}]);
-    
-    objBST.remove(11);
-    
-    
-    const avlTree = new AVLTree();
-    avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
-    avlTree.isAVLBalanced();    // true
-    avlTree.remove(10);
-    avlTree.isAVLBalanced();    // true
+bst.has(6);                            // true
+
+const node6 = bst.get(6);
+node6 && bst.getHeight(6);             // 2
+node6 && bst.getDepth(6);              // 3
+
+const nodeId10 = bst.get(10);
+nodeId10?.id;                          // 10
+
+const nodeVal9 = bst.get(9, 'val');
+nodeVal9?.id;                          // 9
+
+
+const leftMost = bst.getLeftMost();
+leftMost?.id;                          // 1
+
+const node15 = bst.get(15);
+const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
+minNodeBySpecificNode?.id;             // 12
+
+const subTreeSum = node15 && bst.subTreeSum(15);
+subTreeSum;                            // 70
+
+const lesserSum = bst.lesserSum(10);
+lesserSum;                             // 45
+
+node15 instanceof BSTNode;             // true
+
+const node11 = bst.get(11);
+node11 instanceof BSTNode;             // true
+
+const dfsInorderNodes = bst.DFS('in', 'node');
+dfsInorderNodes[0].id;                 // 1
+dfsInorderNodes[dfsInorderNodes.length - 1].id;            // 16
+
+bst.perfectlyBalance();
+bst.isPerfectlyBalanced();                                  // true
+
+const bfsNodesAfterBalanced = bst.BFS('node');
+bfsNodesAfterBalanced[0].id;                                // 8);
+bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].id; // 16
+
+const removed11 = bst.remove(11, true);
+removed11 instanceof Array;                                 // true
 
+
+if (removed11[0].deleted) removed11[0].deleted.id;          // 11
+
+bst.isAVLBalanced();                                        // true
+
+bst.getHeight(15);                                          // 1
+
+const removed1 = bst.remove(1, true);
+removed1 instanceof Array; // true
+
+if (removed1[0].deleted) removed1[0].deleted.id;            // 1
+
+bst.isAVLBalanced();                                        // true
+
+bst.getHeight();                                            // 4
+
+const removed4 = bst.remove(4, true);
+removed4 instanceof Array;                                   // true
+
+if (removed4[0].deleted) removed4[0].deleted.id;            // 4
+bst.isAVLBalanced();                                        // true
+bst.getHeight();                                            // 4
+
+const removed10 = bst.remove(10, true);
+
+if (removed10[0].deleted) removed10[0].deleted.id;           // 10
+bst.isAVLBalanced();                                         // false
+bst.getHeight();                                             // 4
+
+const removed15 = bst.remove(15, true);
+
+if (removed15[0].deleted) removed15[0].deleted.id;           // 15
+
+bst.isAVLBalanced();                                         // true
+bst.getHeight();                                             // 3
+
+const removed5 = bst.remove(5, true);
+
+if (removed5[0].deleted) removed5[0].deleted.id;              // 5
+
+bst.isAVLBalanced();                                          // true
+bst.getHeight();                                              // 3
+
+const removed13 = bst.remove(13, true);
+if (removed13[0].deleted) removed13[0].deleted.id;            // 13
+bst.isAVLBalanced();                                          // true
+bst.getHeight();                                              // 3
+
+const removed3 = bst.remove(3, true);
+if (removed3[0].deleted) removed3[0].deleted.id;               // 3
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed8 = bst.remove(8, true);
+if (removed8[0].deleted) removed8[0].deleted.id;               // 8
+bst.isAVLBalanced();                                           // true
+bst.getHeight();                                               // 3
+
+const removed6 = bst.remove(6, true);
+if (removed6[0].deleted) removed6[0].deleted.id;               // 6
+bst.remove(6, true).length;                                    // 0
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed7 = bst.remove(7, true);
+if (removed7[0].deleted) removed7[0].deleted.id;               // 7
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed9 = bst.remove(9, true);
+if (removed9[0].deleted) removed9[0].deleted.id;               // 9
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed14 = bst.remove(14, true);
+if (removed14[0].deleted) removed14[0].deleted.id;             // 14
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 2
+
+bst.isAVLBalanced();                                           // false
+
+const bfsIDs = bst.BFS();
+bfsIDs[0];                                                     // 2
+bfsIDs[1];                                                     // 12
+bfsIDs[2];                                                     // 16
+
+const bfsNodes = bst.BFS('node');
+bfsNodes[0].id;                                                // 2
+bfsNodes[1].id;                                                // 12
+bfsNodes[2].id;                                                // 16
 ```
 #### JS
 ```javascript
-    const {BST, BSTNode} = require('data-structure-typed');
-
-    const bst = new BST();
-    bst.add(11);
-    bst.add(3);
-    bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
-    bst.size === 16;        // true
-    bst.has(6);             // true
-    const node6 = bst.get(6);
-    bst.getHeight(6) === 2; // true
-    bst.getHeight() === 5;  // true
-    bst.getDepth(6) === 3;  // true
-    const leftMost = bst.getLeftMost();
-    leftMost?.id === 1;     // true
-    expect(leftMost?.id).toBe(1);
-    bst.remove(6);
-    bst.get(6);             // null
-    bst.isAVLBalanced();    // true or false
-    const bfsIDs = bst.BFS();
-    bfsIDs[0] === 11;   // true
-    expect(bfsIDs[0]).toBe(11);
-    
-    const objBST = new BST();
-    objBST.add(11, {id: 11, keyA: 11});
-    objBST.add(3, {id: 3, keyA: 3});
-    
-    objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
-        {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
-        {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
-        {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
-        {id: 10, keyA: 10}, {id: 5, keyA: 5}]);
-    
-    objBST.remove(11);
-    
-    
-    const avlTree = new AVLTree();
-    avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
-    avlTree.isAVLBalanced();    // true
-    avlTree.remove(10);
-    avlTree.isAVLBalanced();    // true
+const {BST, BSTNode} = require('data-structure-typed');
+// /* or if you prefer */ const {BST, BSTNode} = require('bst-typed');
 
-```
+const bst = new BST();
+bst instanceof BST;                    // true
+bst.add(11);
+bst.add(3);
+const idsAndValues = [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5];
+bst.addMany(idsAndValues);
+bst.root instanceof BSTNode;           // true
 
-### Directed Graph simple snippet
+if (bst.root) bst.root.id;             // 11
 
-#### TS or JS
-```typescript
-import {DirectedGraph} from 'data-structure-typed';
-
-    const graph = new DirectedGraph();
-    
-    graph.addVertex('A');
-    graph.addVertex('B');
-    
-    graph.hasVertex('A');       // true
-    graph.hasVertex('B');       // true
-    graph.hasVertex('C');       // false
-    
-    graph.addEdge('A', 'B');
-    graph.hasEdge('A', 'B'); // true
-    graph.hasEdge('B', 'A'); // false
-    
-    graph.removeEdgeSrcToDest('A', 'B');
-    graph.hasEdge('A', 'B');    // false
-    
-    graph.addVertex('C');
-    
-    graph.addEdge('A', 'B');
-    graph.addEdge('B', 'C');
-    
-    const topologicalOrderIds = graph.topologicalSort(); // ['A', 'B', 'C']
-```
+bst.size;                              // 16
 
-### Undirected Graph snippet
+bst.has(6);                            // true
 
-#### TS or JS
-```typescript
-import {UndirectedGraph} from 'data-structure-typed';
-
-    const graph = new UndirectedGraph();
-    graph.addVertex('A');
-    graph.addVertex('B');
-    graph.addVertex('C');
-    graph.addVertex('D');
-    graph.removeVertex('C');
-    graph.addEdge('A', 'B');
-    graph.addEdge('B', 'D');
-    
-    const dijkstraResult = graph.dijkstra('A');
-    Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D']
-```
+const node6 = bst.get(6);
+node6 && bst.getHeight(6);             // 2
+node6 && bst.getDepth(6);              // 3
+
+const nodeId10 = bst.get(10);
+nodeId10?.id;                          // 10
+
+const nodeVal9 = bst.get(9, 'val');
+nodeVal9?.id;                          // 9
+
+
+const leftMost = bst.getLeftMost();
+leftMost?.id;                          // 1
+
+const node15 = bst.get(15);
+const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
+minNodeBySpecificNode?.id;             // 12
+
+const subTreeSum = node15 && bst.subTreeSum(15);
+subTreeSum;                            // 70
+
+const lesserSum = bst.lesserSum(10);
+lesserSum;                             // 45
+
+node15 instanceof BSTNode;             // true
+
+const node11 = bst.get(11);
+node11 instanceof BSTNode;             // true
+
+const dfsInorderNodes = bst.DFS('in', 'node');
+dfsInorderNodes[0].id;                 // 1
+dfsInorderNodes[dfsInorderNodes.length - 1].id;            // 16
+
+bst.perfectlyBalance();
+bst.isPerfectlyBalanced();                                  // true
+
+const bfsNodesAfterBalanced = bst.BFS('node');
+bfsNodesAfterBalanced[0].id;                                // 8);
+bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].id; // 16
+
+const removed11 = bst.remove(11, true);
+removed11 instanceof Array;                                 // true
+
+
+if (removed11[0].deleted) removed11[0].deleted.id;          // 11
+
+bst.isAVLBalanced();                                        // true
+
+bst.getHeight(15);                                          // 1
+
+const removed1 = bst.remove(1, true);
+removed1 instanceof Array; // true
+
+if (removed1[0].deleted) removed1[0].deleted.id;            // 1
+
+bst.isAVLBalanced();                                        // true
+
+bst.getHeight();                                            // 4
+
+const removed4 = bst.remove(4, true);
+removed4 instanceof Array;                                   // true
+
+if (removed4[0].deleted) removed4[0].deleted.id;            // 4
+bst.isAVLBalanced();                                        // true
+bst.getHeight();                                            // 4
+
+const removed10 = bst.remove(10, true);
+
+if (removed10[0].deleted) removed10[0].deleted.id;           // 10
+bst.isAVLBalanced();                                         // false
+bst.getHeight();                                             // 4
+
+const removed15 = bst.remove(15, true);
 
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/dfs-pre-order.webp)
+if (removed15[0].deleted) removed15[0].deleted.id;           // 15
 
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/test-graphs.webp)
+bst.isAVLBalanced();                                         // true
+bst.getHeight();                                             // 3
 
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/cut-off-trees-for-golf.webp)
+const removed5 = bst.remove(5, true);
 
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/parenthesis-check.webp)
+if (removed5[0].deleted) removed5[0].deleted.id;              // 5
+
+bst.isAVLBalanced();                                          // true
+bst.getHeight();                                              // 3
+
+const removed13 = bst.remove(13, true);
+if (removed13[0].deleted) removed13[0].deleted.id;            // 13
+bst.isAVLBalanced();                                          // true
+bst.getHeight();                                              // 3
+
+const removed3 = bst.remove(3, true);
+if (removed3[0].deleted) removed3[0].deleted.id;               // 3
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed8 = bst.remove(8, true);
+if (removed8[0].deleted) removed8[0].deleted.id;               // 8
+bst.isAVLBalanced();                                           // true
+bst.getHeight();                                               // 3
+
+const removed6 = bst.remove(6, true);
+if (removed6[0].deleted) removed6[0].deleted.id;               // 6
+bst.remove(6, true).length;                                    // 0
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed7 = bst.remove(7, true);
+if (removed7[0].deleted) removed7[0].deleted.id;               // 7
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed9 = bst.remove(9, true);
+if (removed9[0].deleted) removed9[0].deleted.id;               // 9
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 3
+
+const removed14 = bst.remove(14, true);
+if (removed14[0].deleted) removed14[0].deleted.id;             // 14
+bst.isAVLBalanced();                                           // false
+bst.getHeight();                                               // 2
+
+bst.isAVLBalanced();                                           // false
+
+const bfsIDs = bst.BFS();
+bfsIDs[0];                                                     // 2
+bfsIDs[1];                                                     // 12
+bfsIDs[2];                                                     // 16
+
+const bfsNodes = bst.BFS('node');
+bfsNodes[0].id;                                                // 2
+bfsNodes[1].id;                                                // 12
+bfsNodes[2].id;                                                // 16
+```
 
 
 ## API docs & Examples
@@ -182,10 +331,6 @@ import {UndirectedGraph} from 'data-structure-typed';
 
 [Live Examples](https://data-structure-typed-examples.vercel.app)
 
-<a href="https://data-structure-typed-examples.vercel.app" target="_blank">Live Examples</a>
-
-[//]: # ([Examples Repository]&#40;https://github.com/zrwusa/data-structure-typed-examples&#41;)
-
 <a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a>
 
 ## Data Structures
@@ -203,10 +348,10 @@ import {UndirectedGraph} from 'data-structure-typed';
 <tbody>
 <tr>
 <td>Binary Tree</td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt="">
-</img></td>
-<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt="">
-</img></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""/>
+</td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""/>
+</td>
 <td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html"><span>Binary Tree</span></a></td>
 <td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
 </tr>
@@ -653,46 +798,6 @@ import {UndirectedGraph} from 'data-structure-typed';
 
 ![complexities of data structures](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/data-structure-complexities.jpg)
 
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/binary-tree/bst-rotation.gif&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/binary-tree/avl-tree-inserting.gif&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan.webp&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-list.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-list-pros-cons.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-matrix.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-matrix-pros-cons.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/dfs-can-do.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/edge-list.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/edge-list-pros-cons.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/max-flow.jpg&#41;)
-
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/mst.jpg&#41;)
-
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan-articulation-point-bridge.png&#41;)
-
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan-complicate-simple.png&#41;)
-
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan-strongly-connected-component.png&#41;)
 
 
 

package/dist/index.d.ts

@@ -1 +1,8 @@
-export * from './bst';
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+export { BSTNode, BST } from 'data-structure-typed';

package/dist/index.js

@@ -1,17 +1,13 @@
 "use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
 Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./bst"), exports);
+exports.BST = exports.BSTNode = void 0;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+var data_structure_typed_1 = require("data-structure-typed");
+Object.defineProperty(exports, "BSTNode", { enumerable: true, get: function () { return data_structure_typed_1.BSTNode; } });
+Object.defineProperty(exports, "BST", { enumerable: true, get: function () { return data_structure_typed_1.BST; } });

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bst-typed",
-  "version": "1.19.45",
+  "version": "1.20.0",
   "description": "BST (Binary Search Tree). Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -65,7 +65,7 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.19.4",
+    "data-structure-typed": "^1.20.0",
     "zod": "^3.22.2"
   }
 }

package/dist/bst.d.ts

@@ -1 +0,0 @@
-export { BSTNode, BST } from 'data-structure-typed';

package/dist/bst.js

@@ -1,6 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BST = exports.BSTNode = void 0;
-var data_structure_typed_1 = require("data-structure-typed");
-Object.defineProperty(exports, "BSTNode", { enumerable: true, get: function () { return data_structure_typed_1.BSTNode; } });
-Object.defineProperty(exports, "BST", { enumerable: true, get: function () { return data_structure_typed_1.BST; } });