Hide text Hide pseudocode  
A heap can be built from a table of random keys by using a linear time bottomup algorithm (a.k.a., BuildHeap, Fixheap, and BottomUp Heap Construction). This algorithm ensures that the heaporder property (the key at each node is lower than or equal to the keys at its children) is not violated in any node. Please note You will be presented with a research related survey when you submit the exercise.  
Algorithm 1 BuildMinHeap(A)
