js-heap-data-structures
Version:
A comprehensive JavaScript implementation of Min Heap and Max Heap data structures with practical utilities
2 lines (1 loc) • 518 B
JavaScript
!function(e){"function"==typeof define&&define.amd?define(e):e()}((function(){"use strict";const e=require("./src/MinHeap"),r=require("./src/MaxHeap"),i=require("./src/PriorityQueue"),{heapSort:t,findKLargest:o,findKSmallest:u}=require("./src/utils");module.exports={MinHeap:e,MaxHeap:r,PriorityQueue:i,heapSort:t,findKLargest:o,findKSmallest:u},module.exports.MinHeap=e,module.exports.MaxHeap=r,module.exports.PriorityQueue=i,module.exports.heapSort=t,module.exports.findKLargest=o,module.exports.findKSmallest=u}));