Gate CS-2019 Question Paper With Solutions

Q. 49 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 Θ(n) time.
  • IV. A binary search tree can be constructed from a max-heap in Θ(n) time.

Which of the above statements is/are TRUE?

(A) II, III and IV

(B) I, II and III

(C) I, III and IV

(D) I, II and IV

Answer: (B)

Explanation:

Learn More:   Gate ME-2006 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here