Question

What is the effect of calling max-heapify.a; i / for i > a:heap-size=2?

Answer 1

· Heap data structure is an array object that can be viewed as a nearly complete binary tree. ... There are two kinds of binary heaps: max-heaps and min-heaps. ... Viewing a heap as a tree and a heap of n elements in based on a complete binary tree,its height is O(log n).