Consider the following statements

Q. Consider the following statements:

1. The smallest element in a max-heap is always at a leaf node
2. The second largest element in a max-heap is always a child of the root node
3. A max-heap can be constructed from a binary search tree in Θ(𝑛) time
4. A binary search tree can be constructed from a max-heap in Θ(𝑛) time

Which of the above statements are TRUE?

(A) I, II and III

(B) I, II and IV

(C) I, III and IV

(D) II, III and IV

Ans: I, II and III