GATE CSE 2025 Session 1 Q26: True facts about any binary search tree

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having $n$ distinct integers?

Try it: multiple select: one or more correct options

Select all correct options. No negative marking, no partial marks.

Show answer and explanation

Answer: A, B (official GATE 2025 final answer key)

Concept used: BST ordering property and the fact that a BST need not be balanced.

First step: Consider a skewed BST (keys inserted in sorted order): it is a chain of $n$ nodes, which settles A and C.

Full step-by-step solution

Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.

Share this question

Source: official GATE 2025 Session 1 CS question paper and final answer key, organised by IIT Roorkee. Question paper · Answer key