removing root from a binary heap
Removing root from a binary heap involves two steps: (1) swapping the root with the last element in the heap, and (2) restoring the binary heap property by sifting down the new root to its correct position.
Requires login.
Related Concepts (1)
Similar Concepts
- balancing a binary heap
- deleting an element from a binary heap
- deletion from a binary heap
- deletion from binary heap
- deletion operation in a binary heap
- extract minimum in a binary heap
- heap sort using binary heap
- heapify operation in binary heap
- heapify operation on a binary heap
- inserting an element into a binary heap
- insertion in a binary heap
- insertion into a binary heap
- insertion into binary heap
- parent-child relationship in a binary heap
- successor in a binary heap