A Heap is a special Tree-based data structure in which the tree is a complete binary tree.
Types of Heaps
•
Binary Heap
◦
Polling: O(log n)
◦
Removing: O(n)
•
Fibonacci Heap
•
Binomial Heap
•
Pairing Heap
Examples
•
Dijkstra’s Shortest Path algorithm
•
Huffman Coding
•
Best First Search (BFS) algorithm
•
Minimum Spanning Tree (MST)
