##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
What heaps support
Three core operations:
Peek: return the root (min or max). Time: .
Insert: add an element, maintain heap property. Time: .
Extract: remove and return the root, maintain heap property. Time: . The comes from the tree height. A complete binary tree with nodes has height .
