Inserting
Time complexity: O(log N)
Space complexity: O(1)
Getting the top element of the Heap
Time complexity: O(1)
Space complexity: O(1)
Deleting the top element
Time complexity: O(log N)
Space complexity: O(1)
Getting the length of a Heap
Time complexity: O(1)
Space complexity: O(1)