Algotree > Algorithms > Heap Data Structure

Heap Data Structure

Heap data structure
- Heap, is a tree-like data structure that satishfies the heap property ( MaxHeap / MinHeap ) - ( MaxHeap ) is a heap in which the data at the root is greater than or equal to the data stored in the child node(s) - ( MinHeap ) is a heap in which the data at the root is less than or equal to the data stored in the child node(s) - In C++, Heap is usually implemented using Priority Queues or Set

Heap data structure

- Heap, is a tree-like data structure that satishfies the heap property ( MaxHeap / MinHeap )
- ( MaxHeap ) is a heap in which the data at the root is greater than or equal to the data stored in the child node(s)
- ( MinHeap ) is a heap in which the data at the root is less than or equal to the data stored in the child node(s)
- In C++, Heap is usually implemented using Priority Queues or Set