Consider the following statements: I. The smallest element in a max-heap is…
PYQ GATE 2019
Consider the following statements:
I. The smallest element in a max-heap is always at a leaf node
II. The second largest element in a max-heap is always a child of the root node
III. A max-heap can be constructed from a binary search tree in Θ(𝑛) time
IV. 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
Attempted by 440 students.
Sign up free to check your answer
Sign up freeLoading lesson…

