Priority Queue Archives - SimpleTechTalks

Maximum Heap Explained With Simple Example

A Maximum 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.

Minimum Heap Explained With Simple Example

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.

Priority Queue Explained With Simple Example

A Priority Queue is an abstract data type similar to Queue which has following properties

Every element in the Priority Queue has a priority associated with it.
An element with high priority will be dequeued first.
If two element has same priority then they are dequeued based on normal Queue basis (FIFO).