Transform and Conquer Flashcards
1
Q
max heaps are
A
complete binary trees at which the key of each node is >= the keys of its children
2
Q
transform sorting into
A
building heaps and maximum_heapify
3
Q
heap sorting has a complexity of
A
O(n logn)
