js-heap-data-structures
Version:
A comprehensive JavaScript implementation of Min Heap and Max Heap data structures with practical utilities
8 lines (7 loc) • 353 B
TypeScript
import MinHeap = require("./src/MinHeap");
import MaxHeap = require("./src/MaxHeap");
import PriorityQueue = require("./src/PriorityQueue");
import { heapSort } from "./src/utils";
import { findKLargest } from "./src/utils";
import { findKSmallest } from "./src/utils";
export { MinHeap, MaxHeap, PriorityQueue, heapSort, findKLargest, findKSmallest };