 Heap - Variants: Encyclopedia II - Heap - Heap applicationsHeaps are favourite data structures for many applications.
Heap sort: One of the best sorting methods being in-place and with no quadratic worst case scenarios.
Selection algorithms: Finding the min, max or both of them, median or even any kth element in sublinear time can be done dynamically with heaps.
Graph algorithms: By using heaps as internal traversal data structures, run time will be reduced by an order of polynomial.
One more advantage of heap over tree in some applications is construction of heap can be don ...
See also:Heap, Heap - Variants, Heap - Comparison of theoretic bounds for variants, Heap - Heap applications Read more here: » Heap: Encyclopedia II - Heap - Heap applications | 
