Heap Data Structure is generally taught with Heapsort. Heapsort algorithm has limited uses because Quicksort is better in practice. Nevertheless, the Heap data structure itself is enormously used. Following are some uses other than Heapsort.
Priority Queues: Priority queues can be efficiently implemented using Binary Heap because it supports insert(), delete() and extractmax(), decreaseKey() operations in O(logn) time. Binomoial Heap and Fibonacci Heap are variations of Binary Heap. These variations perform union also in O(logn) time which is a O(n) operation in Binary Heap. Heap Implemented priority queues are used in Graph algorithms like Prim’s Algorithm and Dijkstra’s algorithm.
Order statistics: The Heap data structure can be used to efficiently find the kth smallest (or largest) element in an array. See method 4 and 6 of this post for details.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Why is Binary Heap Preferred over BST for Priority Queue?
- k largest(or smallest) elements in an array | added Min Heap method
- Binary Heap
- Time Complexity of building a heap
- Binomial Heap
- LFU (Least Frequently Used) Cache Implementation
- Convert BST to Max Heap
- Program for Preemptive Priority CPU Scheduling
- Minimum increment/decrement to make array non-Increasing
- Height of a complete binary tree (or Heap) with N nodes