Classic and high performance data structures implemented in javascript.
- npm i
- npm run build // for production build
- npm run build:dev // for development build
- babel-node ./src/xx.js // run xx.js
- npm run build:es5 // for node server build
- npm test // run tests
-
Array
-
Binary Tree
-
Generalized List
-
Graph
-
List
-
Queue
-
Stack
-
String
-
Search
- sequentialSearch
- binarySearch
- fibonacciSearch
- SecondOptimalSearchTree
- BinarySortedTree
- AVLTree
- RedBlackTree
- BTree
- B+Tree
- DigitalSearchTree / DictionaryTree
- DoubleLinkedTree
- TrieTree
- PatriciaTree todo
- SuffixTree
- HashTable
- Treap todo
- SplayTree todo
- BitMap todo
- Bloom Filter
- ConsistentHash
-
Heap
-
Sort
-
- straightInsertSort
- binaryInsertSort
- path2InsertSort
- staticLinkedListInsertSort
- shellSort
-
- bubbleSort
- bubbleSort2
- cockTailSort
- cockTailSort2
- quickSortRecursive
- quickSortRecursive2
- quickSortNonRecursive
- quickSort
- oddEvenSort
-
- simpleSelectionSort
- heapSort
-
- mergeSortRecursive
- mergeSortNonRecursive
- natureMergeSort
- naturalMergeSort
- linkedListNaturalMergeSort
-
- countSort
- radixSort
- bucketSort
-
- update dependencies