heap_time_complexity.rb

#######################
Time complexities
#######################
Priority Queue (Binary Heap) / Max Heaps or Min Heaps: 
top: O(1), pop: O(logn), add: O(logn), build: O(nlogn), Delete Random: logn if have pointer to element, N otherwise
API: remove, peek, pop, add, size

Priority Queue (Fibonacci Heap):
top: O(1), pop: O(logN), add: O(1), build: O(nlogn), ?Delete Random: logn if have pointer to element, N otherwise

BST:
search: O(1), min/max: O(logn), insert: O(logn), build: O(nlogn)