Code Pumpkin

Tag Archives: MaxHeap

Heap (Min/Max Heap)

March 31, 2017
Posted by Dipen Adroja

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 […]

Total Posts : 124
follow us in feedly
Contribute Your Articles

Cauvery Calling

Cauvery Calling

We may not get time to plant a tree, but we can definitely donate ₹42 per Tree.

Join us to save the planet Earth by donating at CodePumpkin Cauvery Calling Campaign.

Like Us On Facebook