Question

Consider a complete binary tree where the left and right subtrees of the root are max- heaps. The lower bound of the no. Of operations to convert the tree to a heap is: (a) (log n) (b) (n) (c) (n log n) (d) (n2)

Answer 1

Answer:

D one is correct n2 because binary number consist 2 digit