Please enable JavaScript.
Coggle requires JavaScript to display documents.
Heaps and Heapsort - Coggle Diagram
Heaps and Heapsort
-
Property
There exists exactly one essentially complete binary tree with n nodes. Its
height is equal to floor(log2 n).
-
-
-
Deletetion
-
3 - “Heapify” the smaller tree by sifting K down the tree exactly in the same way we did it in the bottom-up heap construction algorithm.
-
-
-
-