Q. Consider the following statements:
- The smallest element in a max-heap is always at a leaf node
- The second largest element in a max-heap is always a child of the root node
- A max-heap can be constructed from a binary search tree in ฮ(๐) time
- 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
![Determine the correctness (or otherwise) of the following Assertion [A] and the Reason [R]](https://www.gkseries.com/blog/wp-content/uploads/2023/10/Determine-the-correctness-or-otherwise-of-the-following-Assertion-A-and-the-Reason-R.jpg)
