Search results
61 packages found
Binary search tree
> In computer science, binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items" (such as numbers, names etc.) in memory. By https://en.wikipedia.org/wiki/Binary_sea
A fully persistent balanced binary search tree. Typed version
Index calculations for inorder layout of balanced binary trees
Javascript implementation of Binary Search Tree
Node Binary Search Tree Library
This is a basic implementation of a sorted array, designed to maintain a collection of items in such a way that it can easily be searched via binary search. Built with effeciency and ease of use in mind.
Typed data structures, algorithms, and utility functions library for JavaScript/TypeScript
- typescript
- data
- structures
- collections
- generics
- linked
- list
- dictionary
- binary
- search
- tree
- key
- value
- stack
- View more
Binary search tree implemented in Javascript.
Common data structures implementation for javascript
- javascript
- data
- structure
- structures
- unit
- test
- coverage
- 100%
- circular
- buffer
- priorit
- yqueue
- stack
- linked
- View more
A complete, fully tested data structure library written in TypeScript.
- typescript
- generics
- data
- structures
- collections
- linked
- list
- dictionary
- default
- multi
- binary
- search
- tree
- key
- View more
Sorted List Implementation Using AVL Tree Data Structure
Sparse & bitwise adjacency matrices, lists and selected traversal algorithms for directed & undirected graphs
- adjacency
- binary
- bitwise
- datastructure
- degree
- directed
- disjointset
- graph
- laplacian
- list
- matrix
- neighbors
- path
- search
- View more
Binary search tree implementation
A JavaScript implementation of the Binary Search Tree data structure
Binary Search Tree for browser or server
A splay tree typescript library
Index computations for balanced binary trees stored in BFS order