Data Structure Typed

Data Structures of Javascript & TypeScript.

Do you envy C++ with STL, Python with collections, and Java with java.util ? Well, no need to envy anymore! JavaScript and TypeScript now have data-structure-typed.

Now you can use this library in Node.js and browser environments in CommonJS(require export.modules = ), ESModule(import export), Typescript(import export), UMD(var Queue = dataStructureTyped.Queue)

Installation and Usage

npm

npm i data-structure-typed

yarn

yarn add data-structure-typed

import {
  BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
  AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultimap,
  DirectedVertex, AVLTreeNode
} from 'data-structure-typed';

CDN

Copy the line below into the head tag in an HTML document.

development

<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.js'></script>

production

<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>

Copy the code below into the script tag of your HTML, and you're good to go with your development work.

const {Heap} = dataStructureTyped;
const {
  BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,
  AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultimap,
  DirectedVertex, AVLTreeNode
} = dataStructureTyped;

Code Snippets

Binary Search Tree (BST) snippet

TS

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.getNode(6);   // BSTNode
bst.getHeight(6) === 2;         // true
bst.getHeight() === 5;          // true
bst.getDepth(6) === 3;          // true

bst.getLeftMost()?.key === 1;   // true

bst.delete(6);
bst.get(6);                     // undefined
bst.isAVLBalanced();            // true
bst.bfs()[0] === 11;            // true

const objBST = new BST<{height: number, age: number}>();

objBST.add(11, { "name": "Pablo", "age": 15 });
objBST.add(3, { "name": "Kirk", "age": 1 });

objBST.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5], [
    { "name": "Alice", "age": 15 },
    { "name": "Bob", "age": 1 },
    { "name": "Charlie", "age": 8 },
    { "name": "David", "age": 13 },
    { "name": "Emma", "age": 16 },
    { "name": "Frank", "age": 2 },
    { "name": "Grace", "age": 6 },
    { "name": "Hannah", "age": 9 },
    { "name": "Isaac", "age": 12 },
    { "name": "Jack", "age": 14 },
    { "name": "Katie", "age": 4 },
    { "name": "Liam", "age": 7 },
    { "name": "Mia", "age": 10 },
    { "name": "Noah", "age": 5 }
  ]
);

objBST.delete(11);

JS

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.getNode(6);
bst.getHeight(6) === 2;         // true
bst.getHeight() === 5;          // true
bst.getDepth(6) === 3;          // true
const leftMost = bst.getLeftMost();
leftMost?.key === 1;            // true

bst.delete(6);
bst.get(6);                     // undefined
bst.isAVLBalanced();            // true or false
const bfsIDs = bst.bfs();
bfsIDs[0] === 11;               // true

AVLTree snippet

TS

import {AVLTree} from 'data-structure-typed';

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.delete(10);
avlTree.isAVLBalanced();    // true

JS

const {AVLTree} = require('data-structure-typed');

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.delete(10);
avlTree.isAVLBalanced();    // true

Directed Graph simple snippet

TS or JS

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.deleteEdgeSrcToDest('A', 'B');
graph.hasEdge('A', 'B');    // false

graph.addVertex('C');

graph.addEdge('A', 'B');
graph.addEdge('B', 'C');

const topologicalOrderKeys = graph.topologicalSort(); // ['A', 'B', 'C']

Undirected Graph snippet

TS or JS

import {UndirectedGraph} from 'data-structure-typed';

const graph = new UndirectedGraph();
graph.addVertex('A');
graph.addVertex('B');
graph.addVertex('C');
graph.addVertex('D');
graph.deleteVertex('C');
graph.addEdge('A', 'B');
graph.addEdge('B', 'D');

const dijkstraResult = graph.dijkstra('A');
Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', 'D']

Built-in classic algorithms

Algorithm	Function Description	Iteration Type
Binary Tree DFS	Traverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree, and then the right subtree, using recursion.	Recursion + Iteration
Binary Tree BFS	Traverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level from left to right.	Iteration
Graph DFS	Traverse a graph in a depth-first manner, starting from a given node, exploring along one path as deeply as possible, and backtracking to explore other paths. Used for finding connected components, paths, etc.	Recursion + Iteration
Binary Tree Morris	Morris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree traversal without additional stack or recursion.	Iteration
Graph BFS	Traverse a graph in a breadth-first manner, starting from a given node, first visiting nodes directly connected to the starting node, and then expanding level by level. Used for finding shortest paths, etc.	Recursion + Iteration
Graph Tarjan's Algorithm	Find strongly connected components in a graph, typically implemented using depth-first search.	Recursion
Graph Bellman-Ford Algorithm	Finding the shortest paths from a single source, can handle negative weight edges	Iteration
Graph Dijkstra's Algorithm	Finding the shortest paths from a single source, cannot handle negative weight edges	Iteration
Graph Floyd-Warshall Algorithm	Finding the shortest paths between all pairs of nodes	Iteration
Graph getCycles	Find all cycles in a graph or detect the presence of cycles.	Recursion
Graph getCutVertexes	Find cut vertices in a graph, which are nodes that, when removed, increase the number of connected components in the graph.	Recursion
Graph getSCCs	Find strongly connected components in a graph, which are subgraphs where any two nodes can reach each other.	Recursion
Graph getBridges	Find bridges in a graph, which are edges that, when removed, increase the number of connected components in the graph.	Recursion
Graph topologicalSort	Perform topological sorting on a directed acyclic graph (DAG) to find a linear order of nodes such that all directed edges go from earlier nodes to later nodes.	Recursion

API docs & Examples

API Docs

Live Examples

Examples Repository

Data Structures

Data Structure	Unit Test	Performance Test	API Documentation	Implemented
Binary Tree			Binary Tree
Binary Search Tree (BST)			BST
AVL Tree			AVLTree
Red Black Tree			RedBlackTree
Tree Multiset			TreeMultimap
Segment Tree			SegmentTree
Binary Indexed Tree			BinaryIndexedTree
Graph			AbstractGraph
Directed Graph			DirectedGraph
Undirected Graph			UndirectedGraph
Linked List			SinglyLinkedList
Singly Linked List			SinglyLinkedList
Doubly Linked List			DoublyLinkedList
Queue			Queue
Object Deque			ObjectDeque
Array Deque			ArrayDeque
Stack			Stack
Coordinate Set			CoordinateSet
Coordinate Map			CoordinateMap
Heap			Heap
Priority Queue			PriorityQueue
Max Priority Queue			MaxPriorityQueue
Min Priority Queue			MinPriorityQueue
Trie			Trie

Standard library data structure comparison

Data Structure Typed	C++ STL	java.util	Python collections
DoublyLinkedList<E>	list<T>	LinkedList<E>	deque
SinglyLinkedList<E>	-	-	-
Array<E>	vector<T>	ArrayList<E>	list
Queue<E>	queue<T>	Queue<E>	-
Deque<E>	deque<T>	-	-
PriorityQueue<E>	priority_queue<T>	PriorityQueue<E>	-
Heap<E>	priority_queue<T>	PriorityQueue<E>	heapq
Stack<E>	stack<T>	Stack<E>	-
Set<E>	set<T>	HashSet<E>	set
Map<K, V>	map<K, V>	HashMap<K, V>	dict
-	unordered_set<T>	HashSet<E>	-
HashMap<K, V>	unordered_map<K, V>	HashMap<K, V>	defaultdict
Map<K, V>	-	-	OrderedDict
BinaryTree<K, V>	-	-	-
BST<K, V>	-	-	-
TreeMultimap<K, V>	multimap<K, V>	-	-
AVLTree<E>	-	TreeSet<E>	-
AVLTree<K, V>	-	TreeMap<K, V>	-
AVLTree<E>	set	TreeSet<E>	-
Trie	-	-	-
-	multiset<T>	-	-
DirectedGraph<V, E>	-	-	-
UndirectedGraph<V, E>	-	-	-
-	unordered_multiset	-	Counter
-	-	LinkedHashSet<E>	-
-	-	LinkedHashMap<K, V>	-
-	unordered_multimap<K, V>	-	-
-	bitset<N>	-	-

Code design

Adhere to ES6 standard naming conventions for APIs.

Standardize API conventions by using 'add' and 'delete' for element manipulation methods in all data structures.

Opt for concise and clear method names, avoiding excessive length while ensuring explicit intent.

Object-oriented programming(OOP)

By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultimap), 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.

Benchmark

avl-tree

test name	time taken (ms)	executions per sec	sample deviation
10,000 add randomly	35.38	28.26	0.00
10,000 add & delete randomly	80.65	12.40	0.01
10,000 addMany	46.45	21.53	9.97e-4
10,000 get	31.59	31.66	0.00

binary-tree

test name	time taken (ms)	executions per sec	sample deviation
1,000 add randomly	13.01	76.84	7.71e-4
1,000 add & delete randomly	16.82	59.46	0.00
1,000 addMany	10.46	95.62	2.13e-4
1,000 get	18.44	54.22	2.49e-4
1,000 dfs	163.31	6.12	0.01
1,000 bfs	58.07	17.22	0.00
1,000 morris	273.11	3.66	0.00

bst

test name	time taken (ms)	executions per sec	sample deviation
10,000 add randomly	33.44	29.91	5.09e-4
10,000 add & delete randomly	76.03	13.15	0.00
10,000 addMany	32.26	31.00	0.00
10,000 get	32.75	30.53	0.01

rb-tree

test name	time taken (ms)	executions per sec	sample deviation
100,000 add	99.27	10.07	0.01
100,000 add & delete randomly	233.22	4.29	0.01
100,000 getNode	148.41	6.74	0.00

directed-graph

test name	time taken (ms)	executions per sec	sample deviation
1,000 addVertex	0.11	9381.52	3.21e-6
1,000 addEdge	6.36	157.14	7.19e-4
1,000 getVertex	0.05	2.09e+4	2.72e-6
1,000 getEdge	24.66	40.55	0.00
tarjan	219.65	4.55	0.01
tarjan all	239.68	4.17	0.04
topologicalSort	216.14	4.63	0.07

hash-map

test name	time taken (ms)	executions per sec	sample deviation
10,000 set	19.50	51.27	0.01
10,000 set & get	38.20	26.18	0.01

heap

test name	time taken (ms)	executions per sec	sample deviation
10,000 add & pop	4.86	205.69	7.04e-4
10,000 fib add & pop	386.50	2.59	0.03

doubly-linked-list

test name	time taken (ms)	executions per sec	sample deviation
1,000,000 unshift	243.46	4.11	0.05
1,000,000 unshift & shift	178.49	5.60	0.02
1,000,000 insertBefore	326.38	3.06	0.07

singly-linked-list

test name	time taken (ms)	executions per sec	sample deviation
10,000 push & pop	232.85	4.29	0.01
10,000 insertBefore	255.90	3.91	0.01

max-priority-queue

test name	time taken (ms)	executions per sec	sample deviation
10,000 refill & poll	11.88	84.15	0.00

priority-queue

test name	time taken (ms)	executions per sec	sample deviation
10,000 add & pop	12.60	79.35	1.40e-4

deque

test name	time taken (ms)	executions per sec	sample deviation
1,000,000 push	226.32	4.42	0.03
1,000,000 shift	26.09	38.33	0.00

queue

test name	time taken (ms)	executions per sec	sample deviation
1,000,000 push	45.45	22.00	0.01
1,000,000 push & shift	82.87	12.07	0.00

stack

test name	time taken (ms)	executions per sec	sample deviation
1,000,000 push	43.95	22.75	0.01
1,000,000 push & pop	50.91	19.64	0.00

trie

test name	time taken (ms)	executions per sec	sample deviation
100,000 push	50.20	19.92	0.00
100,000 getWords	110.08	9.08	0.01