Please enable JavaScript.
Coggle requires JavaScript to display documents.
Heaps - Coggle Diagram
Heaps
Properties
There exists exactly one essentially complete binary tree with n nodes. Its height is equal to log2 n.
-
-
A heap can be implemented as an array by recording its elements in the top-down, left-to-right fashion.
-
-
Binary tree (Like)
-
The parental dominance or heap property: The key in each node is greater than or equal to the keys in its children.