The Binary Heap. Binary Heap Looks similar to a binary search tree BUT all the values stored in the subtree rooted at a node are greater than or equal.
Priority Queues (Heaps) Efficient implementation of the priority queue ADT Uses of priority queues Advanced implementation of priority queues.
The Binary Heap
