GATE CS 2019 (Forenoon) — Question 50

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ2 marks · −2/3 if wrongEasy

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 \( \Theta(n) \) time. IV. A binary search tree can be constructed from a max-heap in \( \Theta(n) \) time. Which of the above statements are TRUE?
  1. A
    I, II and III
  2. B
    I, II and IV
  3. C
    I, III and IV
  4. D
    II, III and IV
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.
Practise more on Binary Search Trees (BSTs) & Binary HeapsTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group