GATE CS 2017 (Forenoon) — Question 6

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMCQ1 mark · −1/3 if wrongEasy

Let \(T\) be a binary search tree with 15 nodes. The minimum and maximum possible heights of \(T\) are: Note: The height of a tree with a single node is 0.
  1. A
    4 and 15 respectively
  2. B
    3 and 14 respectively
  3. C
    4 and 14 respectively
  4. D
    3 and 15 respectively
Practise the full 2017-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