bst-typed

Version:

Binary Search Tree

data-structure-typed-docs.vercel.app

23 lines • 99.6 kB

HTML

<!DOCTYPE html><html class="default" lang="en"><head><meta charSet="utf-8"/><meta http-equiv="x-ua-compatible" content="IE=edge"/><title>bst-typed</title><meta name="description" content="Documentation for bst-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">bst-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>bst-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>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 <a href="https://www.npmjs.com/package/data-structure-typed">data-structure-typed</a> package <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">npm i bst-typed --save </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">yarn add bst-typed </code><button>Copy</button></pre> <a id="md:methods" class="tsd-anchor"></a><h3><a href="#md:methods">methods</a></h3><img src="https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/methods-8bit/bst.png?raw=true" alt=""> <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">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 </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">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<span