max heap
A max heap is a complete binary tree data structure in which the value of each parent node is greater than or equal to the values of its children nodes, making the maximum value always at the root.
Requires login.
Related Concepts (20)
- balancing
- binary heap
- binary heap visualization
- binary search tree
- complete binary tree
- d-ary heap
- data structure
- fibonacci heap
- graphical representation of binary heap
- heap
- heap data structure
- heap sort
- leftist heap
- mergeable heap
- min heap
- parent-child relationship
- priority queue
- skew heap
- tree rotation
- visualization of binary heap structure