Let 𝑃 be the set of all integers from 1 to 15. Consider any order of…

GATE Β· 2026 Β· CS Β· Set 1 Β· Computer Science & IT

Let 𝑃 be the set of all integers from 1 to 15. Consider any order of insertion of the elements of 𝑃 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

Attempted by 119 students.

Show answer

Correct answer: D

The worked solution is available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…