Creates a new heap.
Creates a new heap. The pbl heap implementation is a binary heap using an array list as underlying data structure. This function has a time complexity of O(1).
The pbl heap implementation is a binary heap using an array list as underlying data structure.
This function has a time complexity of O(1).
Alphabetic index