A binary heap is a complete binary tree which satisfies the heap ordering property. The ordering can be one of two types:
- the min-heap property: the value of each node is greater than or equal to the value of its parent, with the minimum-value element at the root.
- the max-heap property: the value of each node is less than or equal to the value of its parent, with the maximum-value element at the root.
A heap is not a sorted structure and can be regarded as partially ordered: there is no particular relationship among nodes on any given level, even among the siblings. It is useful data structure when you need to remove the object with the highest (or lowest) priority. A common use of a heap is to implement a priority queue.
$ npm install --save jsheap
Initialises a HeapTree object
params: object with keys 'src' (source array) and 'check' (whether to perform a heapify)
Gets the underlying array structure
Transform an array into a max-heap
Gets the level of a node
Gets the parent of a node
Gets the left child of a node
Gets the right child of a node
Gets the root of the heap
Gets the last leaf of the heap
Checks whether the heap is empty
Bubble up a node to its correct position
Bubble down a node to its correct position
Inserts a node into the heap
Deletes the root
Deletes a node from the heap