bst-typed 1.3.1

package/README.md

@@ -0,0 +1,805 @@
+# What
+## Brief
+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
+
+
+# How
+
+## install
+### npm
+```bash
+npm i bst-typed
+```
+### yarn
+```bash
+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';
+
+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
+
+if (bst.root) bst.root.id;             // 11
+
+bst.size;                              // 16
+
+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');
+// /* 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
+
+if (bst.root) bst.root.id;             // 11
+
+bst.size;                              // 16
+
+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
+```
+
+
+## API docs & Examples
+
+[API Docs](https://data-structure-typed-docs.vercel.app)
+
+[Live Examples](https://data-structure-typed-examples.vercel.app)
+
+<a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a>
+
+## Data Structures
+
+<table>
+<thead>
+<tr>
+<th>Data Structure</th>
+<th>Unit Test</th>
+<th>Performance Test</th>
+<th>API Documentation</th>
+<th>Implemented</th>
+</tr>
+</thead>
+<tbody>
+<tr>
+<td>Binary Tree</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>
+<tr>
+<td>Binary Search Tree (BST)</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/BST.html"><span>BST</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>AVL Tree</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/AVLTree.html"><span>AVLTree</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Tree Multiset</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/TreeMultiset.html"><span>TreeMultiset</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Segment Tree</td>
+<td></td>
+<td></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html"><span>SegmentTree</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Binary Indexed Tree</td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+<td></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html"><span>BinaryIndexedTree</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Graph</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/AbstractGraph.html"><span>AbstractGraph</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Directed Graph</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/DirectedGraph.html"><span>DirectedGraph</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Undirected Graph</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/UndirectedGraph.html"><span>UndirectedGraph</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Linked List</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/SinglyLinkedList.html"><span>SinglyLinkedList</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Singly Linked List</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/SinglyLinkedList.html"><span>SinglyLinkedList</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Doubly Linked List</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/DoublyLinkedList.html"><span>DoublyLinkedList</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Queue</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/Queue.html"><span>Queue</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Object Deque</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/ObjectDeque.html"><span>ObjectDeque</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Array Deque</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/ArrayDeque.html"><span>ArrayDeque</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Stack</td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+<td></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html"><span>Stack</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+
+[//]: # (<tr>)
+
+[//]: # (<td>Hash</td>)
+
+[//]: # (<td></td>)
+
+[//]: # (<td></td>)
+
+[//]: # (<td><a href="https://data-structure-typed-docs.vercel.app/classes/HashTable.html"><span>HashTable</span></a></td>)
+
+[//]: # (<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>)
+
+[//]: # (</tr>)
+<tr>
+<td>Coordinate Set</td>
+<td></td>
+<td></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateSet.html"><span>CoordinateSet</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Coordinate Map</td>
+<td></td>
+<td></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateMap.html"><span>CoordinateMap</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Heap</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/Heap.html"><span>Heap</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Priority Queue</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/PriorityQueue.html"><span>PriorityQueue</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Max Priority Queue</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/MaxPriorityQueue.html"><span>MaxPriorityQueue</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Min Priority Queue</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/MinPriorityQueue.html"><span>MinPriorityQueue</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+<tr>
+<td>Trie</td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+<td></td>
+<td><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html"><span>Trie</span></a></td>
+<td><img src="https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/assets/tick.svg" alt=""></td>
+</tr>
+</tbody>
+</table>
+
+
+# Why
+
+## Complexities
+
+### performance of Big O
+
+<table>
+<thead>
+<tr>
+<th>Big O Notation</th>
+<th>Type</th>
+<th>Computations for 10 elements</th>
+<th>Computations for 100 elements</th>
+<th>Computations for 1000 elements</th>
+</tr>
+</thead>
+<tbody>
+<tr>
+<td><strong>O(1)</strong></td>
+<td>Constant</td>
+<td>1</td>
+<td>1</td>
+<td>1</td>
+</tr>
+<tr>
+<td><strong>O(log N)</strong></td>
+<td>Logarithmic</td>
+<td>3</td>
+<td>6</td>
+<td>9</td>
+</tr>
+<tr>
+<td><strong>O(N)</strong></td>
+<td>Linear</td>
+<td>10</td>
+<td>100</td>
+<td>1000</td>
+</tr>
+<tr>
+<td><strong>O(N log N)</strong></td>
+<td>n log(n)</td>
+<td>30</td>
+<td>600</td>
+<td>9000</td>
+</tr>
+<tr>
+<td><strong>O(N^2)</strong></td>
+<td>Quadratic</td>
+<td>100</td>
+<td>10000</td>
+<td>1000000</td>
+</tr>
+<tr>
+<td><strong>O(2^N)</strong></td>
+<td>Exponential</td>
+<td>1024</td>
+<td>1.26e+29</td>
+<td>1.07e+301</td>
+</tr>
+<tr>
+<td><strong>O(N!)</strong></td>
+<td>Factorial</td>
+<td>3628800</td>
+<td>9.3e+157</td>
+<td>4.02e+2567</td>
+</tr>
+</tbody>
+</table>
+
+### Data Structure Complexity
+
+<table>
+<thead>
+<tr>
+<th>Data Structure</th>
+<th>Access</th>
+<th>Search</th>
+<th>Insertion</th>
+<th>Deletion</th>
+<th>Comments</th>
+</tr>
+</thead>
+<tbody>
+<tr>
+<td><strong>Array</strong></td>
+<td>1</td>
+<td>n</td>
+<td>n</td>
+<td>n</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Stack</strong></td>
+<td>n</td>
+<td>n</td>
+<td>1</td>
+<td>1</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Queue</strong></td>
+<td>n</td>
+<td>n</td>
+<td>1</td>
+<td>1</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Linked List</strong></td>
+<td>n</td>
+<td>n</td>
+<td>1</td>
+<td>n</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Hash Table</strong></td>
+<td>-</td>
+<td>n</td>
+<td>n</td>
+<td>n</td>
+<td>In case of perfect hash function costs would be O(1)</td>
+</tr>
+<tr>
+<td><strong>Binary Search Tree</strong></td>
+<td>n</td>
+<td>n</td>
+<td>n</td>
+<td>n</td>
+<td>In case of balanced tree costs would be O(log(n))</td>
+</tr>
+<tr>
+<td><strong>B-Tree</strong></td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Red-Black Tree</strong></td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>AVL Tree</strong></td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td>log(n)</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Bloom Filter</strong></td>
+<td>-</td>
+<td>1</td>
+<td>1</td>
+<td>-</td>
+<td>False positives are possible while searching</td>
+</tr>
+</tbody>
+</table>
+
+### Sorting Complexity
+
+<table>
+<thead>
+<tr>
+<th>Name</th>
+<th>Best</th>
+<th>Average</th>
+<th>Worst</th>
+<th>Memory</th>
+<th>Stable</th>
+<th>Comments</th>
+</tr>
+</thead>
+<tbody>
+<tr>
+<td><strong>Bubble sort</strong></td>
+<td>n</td>
+<td>n<sup>2</sup></td>
+<td>n<sup>2</sup></td>
+<td>1</td>
+<td>Yes</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Insertion sort</strong></td>
+<td>n</td>
+<td>n<sup>2</sup></td>
+<td>n<sup>2</sup></td>
+<td>1</td>
+<td>Yes</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Selection sort</strong></td>
+<td>n<sup>2</sup></td>
+<td>n<sup>2</sup></td>
+<td>n<sup>2</sup></td>
+<td>1</td>
+<td>No</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Heap sort</strong></td>
+<td>n&nbsp;log(n)</td>
+<td>n&nbsp;log(n)</td>
+<td>n&nbsp;log(n)</td>
+<td>1</td>
+<td>No</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Merge sort</strong></td>
+<td>n&nbsp;log(n)</td>
+<td>n&nbsp;log(n)</td>
+<td>n&nbsp;log(n)</td>
+<td>n</td>
+<td>Yes</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Quick sort</strong></td>
+<td>n&nbsp;log(n)</td>
+<td>n&nbsp;log(n)</td>
+<td>n<sup>2</sup></td>
+<td>log(n)</td>
+<td>No</td>
+<td>Quicksort is usually done in-place with O(log(n)) stack space</td>
+</tr>
+<tr>
+<td><strong>Shell sort</strong></td>
+<td>n&nbsp;log(n)</td>
+<td>depends on gap sequence</td>
+<td>n&nbsp;(log(n))<sup>2</sup></td>
+<td>1</td>
+<td>No</td>
+<td></td>
+</tr>
+<tr>
+<td><strong>Counting sort</strong></td>
+<td>n + r</td>
+<td>n + r</td>
+<td>n + r</td>
+<td>n + r</td>
+<td>Yes</td>
+<td>r - biggest number in array</td>
+</tr>
+<tr>
+<td><strong>Radix sort</strong></td>
+<td>n * k</td>
+<td>n * k</td>
+<td>n * k</td>
+<td>n + k</td>
+<td>Yes</td>
+<td>k - length of longest key</td>
+</tr>
+</tbody>
+</table>
+
+![overview diagram](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/overview-diagram-of-data-structures.png)
+
+![complexities](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/complexities-diff.jpg)
+
+![complexities of data structures](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/data-structure-complexities.jpg)
+
+
+
+
+
+