Data Structure in TypeScript
-
Updated
Oct 10, 2021 - TypeScript
Data Structure in TypeScript
A data structure and algorithms library written in TypeScript.
A library consisting of standard data structures implemented using TypeScript.
A flexible binary heap. Can be used as a priority queue.
Priority queue implemented with indirect binary heap
Mentoring event loop.
Typescript implementation of minimum and maximum heap (priority queue).
Data Structures in TypeScript
Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.
Priority Queue in Typescript & Javascript
Efficient Binary heap (priority queue, binary tree) data structure for JavaScript / TypeScript. Includes JavaScript methods, Python's heapq module methods, and Java's PriorityQueue methods.
The fastest JavaScript priority queue out there. Zero dependencies.
data structures and algorithms
Add a description, image, and links to the binary-heap topic page so that developers can more easily learn about it.
To associate your repository with the binary-heap topic, visit your repo's landing page and select "manage topics."