GATE CS 2025 (Forenoon) — Question 26

Data StructuresBinary Search Trees (BSTs) & Binary HeapsMSQ1 markEasy

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having \( n \) distinct integers?
  1. A
    The maximum length of a path from the root node to any other node is \( (n - 1) \).
  2. B
    An inorder traversal will always produce a sorted sequence of elements.
  3. C
    Finding an element takes \( O(\log_2 n) \) time in the worst case.
  4. D
    Every BST is also a Min-Heap.
Practise the full 2025-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