slidesharetrick

In a max heap the key present at the root node must be greatest among the keys present at all of it s children. If a node is stored a index k then its left child is stored at index 2k 1 and its right child at index 2k 2. Heap Data Structure Tutorial With Examples In this tutorial we saw an impl…