GATE CS 2026 (Forenoon) — Question 40

Data StructuresBSTs & Binary HeapsMCQ2 marks · −2/3 if wrongHard

Let \( P \) be the set of all integers from 1 to 15. Consider any order of insertion of the elements of \( P \) into a binary search tree that creates a complete binary tree. Which one of the following elements can NEVER be the third element that is inserted?
  1. A
    4
  2. B
    2
  3. C
    10
  4. D
    5
Practise the full 2026-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 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