Q40

MCQ2 marks, −0.67

Consider the following statements: Which of the above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV

(A)

The smallest element in a max-heap is always at a leaf node

(B)

The second largest element in a max-heap is always a child of a root node

(C)

A max-heap can be constructed from a binary search tree in $\Theta(n)$ time

(D)

A binary search tree can be constructed from a max-heap in $\Theta(n)$ time

Loading…