Heap
Heap
A heap is a kind of tree. It offers both insertion and deletion
in O(logN) time.
Thus, it’s not quite as fast for deletion, but much faster for insertion.
It’s the method of choice for implementing priority queues where speed is
important and there will be many insertions.