Minimum Heap Explained With Simple Example
by A minimum heap is a binary tree which has following properties:
- Binary tree MUST be a complete binary tree which means all leaf nodes are present in either at height “h” or “h-1”.
- Key stored in each node is smaller than or equal to keys in the node’s children.
Before going ahead have a look into Binary Tree.
(more…)