min-heap
A min-heap is a complete binary tree where the value of each node is less than or equal to the values of its children. It is used to implement the priority queue data structure efficiently.
Requires login.
Related Concepts (21)
- balanced binary tree
- binary heap
- binary heap implementation
- binary heap representation
- binary heap visualization
- binary search tree
- complete binary tree
- data sorting
- decrease-key operation
- deletion operation
- extract-min operation
- heap data structure
- heap sort algorithm
- heapify operation
- insertion in a binary heap
- insertion operation
- max-heap
- priority queue
- sift down
- sift up
- tree traversal