Learning JavaScript Data Structures and Algorithms - Third Edition

Finding the minimum or maximum value from the heap

In the min heap, the minimum value is always located at the first index of the array (the root of the heap). The code is presented as follows:

size() {
  return this.heap.length;
}
isEmpty() {
  return this.size() === 0;
}
findMinimum() {
  return this.isEmpty() ? undefined : this.heap[0]; // {1}
}

So if the heap is not empty, we return the first index of the array ({1}). We can also create the size and empty methods for the MinHeap data structure.

The following code can be used to test these three methods:

console.log('Heap size: ', heap.size()); // 5console.log('Heap is empty: ', heap.isEmpty()); // falseconsole.log('Heap min value: ', heap.findMinimum()); // 1

In the max heap, the first index ...