What is heap? Heap is a balanced binary tree data strucure where the root-node key is compared with its children and arranged accordingly. Max Heap: Root element will always be greater than or equal to either of its child element( see the image on left pane). Min Heap: Root element will always be less than or equal […]