avl-tree-typed
Version:
Standard AVL tree
123 lines • 78.2 kB
HTML
<!DOCTYPE html><html class="default" lang="en"><head><meta charSet="utf-8"/><meta http-equiv="x-ua-compatible" content="IE=edge"/><title>avl-tree-typed</title><meta name="description" content="Documentation for avl-tree-typed"/><meta name="viewport" content="width=device-width, initial-scale=1"/><link rel="stylesheet" href="assets/style.css"/><link rel="stylesheet" href="assets/highlight.css"/><script defer src="assets/main.js"></script><script async src="assets/search.js" id="tsd-search-script"></script><script async src="assets/navigation.js" id="tsd-nav-script"></script></head><body><script>document.documentElement.dataset.theme = localStorage.getItem("tsd-theme") || "os"</script><header class="tsd-page-toolbar">
<div class="tsd-toolbar-contents container">
<div class="table-cell" id="tsd-search" data-base=".">
<div class="field"><label for="tsd-search-field" class="tsd-widget tsd-toolbar-icon search no-caption"><svg width="16" height="16" viewBox="0 0 16 16" fill="none"><use href="#icon-search"></use></svg></label><input type="text" id="tsd-search-field" aria-label="Search"/></div>
<div class="field">
<div id="tsd-toolbar-links"></div></div>
<ul class="results">
<li class="state loading">Preparing search index...</li>
<li class="state failure">The search index is not available</li></ul><a href="index.html" class="title">avl-tree-typed</a></div>
<div class="table-cell" id="tsd-widgets"><a href="#" class="tsd-widget tsd-toolbar-icon menu no-caption" data-toggle="menu" aria-label="Menu"><svg width="16" height="16" viewBox="0 0 16 16" fill="none"><use href="#icon-menu"></use></svg></a></div></div></header>
<div class="container container-main">
<div class="col-content">
<div class="tsd-page-title">
<h2>avl-tree-typed</h2></div>
<div class="tsd-panel tsd-typography"><a id="md:what" class="tsd-anchor"></a><h1><a href="#md:what">What</a></h1><a id="md:brief" class="tsd-anchor"></a><h2><a href="#md:brief">Brief</a></h2><p>This is a standalone AVL 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 <a href="https://www.npmjs.com/package/data-structure-typed">data-structure-typed</a> package</p>
<a id="md:how" class="tsd-anchor"></a><h1><a href="#md:how">How</a></h1><a id="md:install" class="tsd-anchor"></a><h2><a href="#md:install">install</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">i</span><span class="hl-1"> </span><span class="hl-2">avl-tree-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">avl-tree-typed</span>
</code><button>Copy</button></pre>
<a id="md:methods" class="tsd-anchor"></a><h3><a href="#md:methods">methods</a></h3><p><img src="https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/methods-8bit/avl-tree.png?raw=true" alt=""></p>
<a id="md:snippet" class="tsd-anchor"></a><h3><a href="#md:snippet">snippet</a></h3><a id="md:ts" class="tsd-anchor"></a><h4><a href="#md:ts">TS</a></h4><pre><code class="language-typescript"><span class="hl-4">import</span><span class="hl-1"> {</span><span class="hl-5">AVLTree</span><span class="hl-1">, </span><span class="hl-5">AVLTreeNode</span><span class="hl-1">} </span><span class="hl-4">from</span><span class="hl-1"> </span><span class="hl-2">'data-structure-typed'</span><span class="hl-1">;</span><br/><span class="hl-6">// /* or if you prefer */ import {AVLTree} from 'avl-tree-typed';</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">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><span class="hl-8">AVLTreeNode</span><span class="hl-1"><</span><span class="hl-8">number</span><span class="hl-1">>>();</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">idsOrVals</span><span class="hl-1"> = [</span><span class="hl-9">11</span><span class="hl-1">, </span><span class="hl-9">3</span><span class="hl-1">, </span><span class="hl-9">15</span><span class="hl-1">, </span><span class="hl-9">1</span><span class="hl-1">, </span><span class="hl-9">8</span><span class="hl-1">, </span><span class="hl-9">13</span><span class="hl-1">, </span><span class="hl-9">16</span><span class="hl-1">, </span><span class="hl-9">2</span><span class="hl-1">, </span><span class="hl-9">6</span><span class="hl-1">, </span><span class="hl-9">9</span><span class="hl-1">, </span><span class="hl-9">12</span><span class="hl-1">, </span><span class="hl-9">14</span><span class="hl-1">, </span><span class="hl-9">4</span><span class="hl-1">, </span><span class="hl-9">7</span><span class="hl-1">, </span><span class="hl-9">10</span><span class="hl-1">, </span><span class="hl-9">5</span><span class="hl-1">];</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">(</span><span class="hl-5">idsOrVals</span><span class="hl-1">, </span><span class="hl-5">idsOrVals</span><span class="hl-1">);</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">node6</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">6</span><span class="hl-1">);</span><br/><span class="hl-5">node6</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-5">node6</span><span class="hl-1">) </span><span class="hl-6">// 3</span><br/><span class="hl-5">node6</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getDepth</span><span class="hl-1">(</span><span class="hl-5">node6</span><span class="hl-1">) </span><span class="hl-6">// 1</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">getNodeById</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">10</span><span class="hl-1">, </span><span class="hl-2">'id'</span><span class="hl-1">);</span><br/><span class="hl-5">getNodeById</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 10</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">getMinNodeByRoot</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">();</span><br/><span class="hl-5">getMinNodeByRoot</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 1</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">node15</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">15</span><span class="hl-1">);</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">getMinNodeBySpecificNode</span><span class="hl-1"> = </span><span class="hl-5">node15</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">(</span><span class="hl-5">node15</span><span class="hl-1">);</span><br/><span class="hl-5">getMinNodeBySpecificNode</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 12</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">subTreeSum</span><span class="hl-1"> = </span><span class="hl-5">node15</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">subTreeSum</span><span class="hl-1">(</span><span class="hl-5">node15</span><span class="hl-1">);</span><br/><span class="hl-5">subTreeSum</span><span class="hl-1"> </span><span class="hl-6">// 70</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">lesserSum</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">lesserSum</span><span class="hl-1">(</span><span class="hl-9">10</span><span class="hl-1">);</span><br/><span class="hl-5">lesserSum</span><span class="hl-1"> </span><span class="hl-6">// 45</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">node11</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">11</span><span class="hl-1">);</span><br/><span class="hl-5">node11</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 11</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">dfs</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">DFS</span><span class="hl-1">(</span><span class="hl-2">'in'</span><span class="hl-1">, </span><span class="hl-2">'node'</span><span class="hl-1">);</span><br/><span class="hl-5">dfs</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 1 </span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">perfectlyBalance</span><span class="hl-1">();</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">bfs</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">(</span><span class="hl-2">'node'</span><span class="hl-1">);</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isPerfectlyBalanced</span><span class="hl-1">() && </span><span class="hl-5">bfs</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 8 </span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">11</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 11</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">node15</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-5">node15</span><span class="hl-1">) </span><span class="hl-6">// 2</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">1</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 1</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 4</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">4</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 4</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 4</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">10</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 10</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">15</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 15</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">5</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 5</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">13</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 13</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">3</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 3</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">8</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 8</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">6</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 6</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">6</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">).</span><span class="hl-5">length</span><span class="hl-1"> </span><span class="hl-6">// 0</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 2</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">7</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 7</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 2</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">9</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 9</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 2</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">14</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 14</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 1</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">lastBFSIds</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">();</span><br/><span class="hl-5">lastBFSIds</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">] </span><span class="hl-6">// 12 </span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">lastBFSNodes</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">(</span><span class="hl-2">'node'</span><span class="hl-1">);</span><br/><span class="hl-5">lastBFSNodes</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 12</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-javascript"><span class="hl-3">const</span><span class="hl-1"> {</span><span class="hl-7">AVLTree</span><span class="hl-1">} = </span><span class="hl-0">require</span><span class="hl-1">(</span><span class="hl-2">'data-structure-typed'</span><span class="hl-1">);</span><br/><span class="hl-6">// /* or if you prefer */ const {AVLTree} = require('avl-tree-typed');</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">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/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">idsOrVals</span><span class="hl-1"> = [</span><span class="hl-9">11</span><span class="hl-1">, </span><span class="hl-9">3</span><span class="hl-1">, </span><span class="hl-9">15</span><span class="hl-1">, </span><span class="hl-9">1</span><span class="hl-1">, </span><span class="hl-9">8</span><span class="hl-1">, </span><span class="hl-9">13</span><span class="hl-1">, </span><span class="hl-9">16</span><span class="hl-1">, </span><span class="hl-9">2</span><span class="hl-1">, </span><span class="hl-9">6</span><span class="hl-1">, </span><span class="hl-9">9</span><span class="hl-1">, </span><span class="hl-9">12</span><span class="hl-1">, </span><span class="hl-9">14</span><span class="hl-1">, </span><span class="hl-9">4</span><span class="hl-1">, </span><span class="hl-9">7</span><span class="hl-1">, </span><span class="hl-9">10</span><span class="hl-1">, </span><span class="hl-9">5</span><span class="hl-1">];</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">addMany</span><span class="hl-1">(</span><span class="hl-5">idsOrVals</span><span class="hl-1">, </span><span class="hl-5">idsOrVals</span><span class="hl-1">);</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">node6</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">6</span><span class="hl-1">);</span><br/><span class="hl-5">node6</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-5">node6</span><span class="hl-1">) </span><span class="hl-6">// 3</span><br/><span class="hl-5">node6</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getDepth</span><span class="hl-1">(</span><span class="hl-5">node6</span><span class="hl-1">) </span><span class="hl-6">// 1</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">getNodeById</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">10</span><span class="hl-1">, </span><span class="hl-2">'id'</span><span class="hl-1">);</span><br/><span class="hl-5">getNodeById</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 10</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">getMinNodeByRoot</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">();</span><br/><span class="hl-5">getMinNodeByRoot</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 1</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">node15</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">15</span><span class="hl-1">);</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">getMinNodeBySpecificNode</span><span class="hl-1"> = </span><span class="hl-5">node15</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getLeftMost</span><span class="hl-1">(</span><span class="hl-5">node15</span><span class="hl-1">);</span><br/><span class="hl-5">getMinNodeBySpecificNode</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 12</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">subTreeSum</span><span class="hl-1"> = </span><span class="hl-5">node15</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">subTreeSum</span><span class="hl-1">(</span><span class="hl-5">node15</span><span class="hl-1">);</span><br/><span class="hl-5">subTreeSum</span><span class="hl-1"> </span><span class="hl-6">// 70</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">lesserSum</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">lesserSum</span><span class="hl-1">(</span><span class="hl-9">10</span><span class="hl-1">);</span><br/><span class="hl-5">lesserSum</span><span class="hl-1"> </span><span class="hl-6">// 45</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">node11</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">get</span><span class="hl-1">(</span><span class="hl-9">11</span><span class="hl-1">);</span><br/><span class="hl-5">node11</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 11</span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">dfs</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">DFS</span><span class="hl-1">(</span><span class="hl-2">'in'</span><span class="hl-1">, </span><span class="hl-2">'node'</span><span class="hl-1">);</span><br/><span class="hl-5">dfs</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 1 </span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">perfectlyBalance</span><span class="hl-1">();</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">bfs</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">(</span><span class="hl-2">'node'</span><span class="hl-1">);</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isPerfectlyBalanced</span><span class="hl-1">() && </span><span class="hl-5">bfs</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 8 </span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">11</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 11</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">node15</span><span class="hl-1"> && </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">(</span><span class="hl-5">node15</span><span class="hl-1">) </span><span class="hl-6">// 2</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">1</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 1</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 4</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">4</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 4</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 4</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">10</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 10</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">15</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 15</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">5</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 5</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">13</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 13</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">3</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 3</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">8</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 8</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 3</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">6</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 6</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">6</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">).</span><span class="hl-5">length</span><span class="hl-1"> </span><span class="hl-6">// 0</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 2</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">7</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 7</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 2</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">9</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 9</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 2</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">remove</span><span class="hl-1">(</span><span class="hl-9">14</span><span class="hl-1">, </span><span class="hl-3">true</span><span class="hl-1">)[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">deleted</span><span class="hl-1">?.</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 14</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">getHeight</span><span class="hl-1">() </span><span class="hl-6">// 1</span><br/><br/><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">isAVLBalanced</span><span class="hl-1">(); </span><span class="hl-6">// true</span><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">lastBFSIds</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">();</span><br/><span class="hl-5">lastBFSIds</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">] </span><span class="hl-6">// 12 </span><br/><br/><span class="hl-3">const</span><span class="hl-1"> </span><span class="hl-7">lastBFSNodes</span><span class="hl-1"> = </span><span class="hl-5">avlTree</span><span class="hl-1">.</span><span class="hl-0">BFS</span><span class="hl-1">(</span><span class="hl-2">'node'</span><span class="hl-1">);</span><br/><span class="hl-5">lastBFSNodes</span><span class="hl-1">[</span><span class="hl-9">0</span><span class="hl-1">].</span><span class="hl-5">id</span><span class="hl-1"> </span><span class="hl-6">// 12</span>
</code><button>Copy</button></pre>
<a id="md:api-docs-amp-examples" class="tsd-anchor"></a><h2><a href="#md:api-docs-amp-examples">API docs & Examples</a></h2><p><a href="https://data-structure-typed-docs.vercel.app">API Docs</a></p>
<p><a href="https://data-structure-typed-examples.vercel.app">Live Examples</a></p>
<p><a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a></p>
<a id="md:data-structures" class="tsd-anchor"></a><h2><a href="#md:data-structures">Data Structures</a></h2><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