engineering recuitment GATE CSE 2023-24 Test Series Algorithms Searching, Sorting and Hashing Sorting
Consider the following statements:
I. The second largest element in a max-heap is always a child of the root node
II. A max-heap can be constructed from a binary search tree in Θ(n) time
Which of the above statements is/are FALSE if heap consists of distinct elements?
1
Only I
2
Only II
3
Both I and II
4
None of these