Which of the following statement(s) is/are TRUE for any binary search tree…

PYQ GATE 2025

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

  1. A.

    The maximum length of a path from the root node to any other node is (𝑛−1)(𝑛 − 1).

  2. B.

    An inorder traversal will always produce a sorted sequence of elements

  3. C.

    Finding an element takes 𝑂(log2𝑛)𝑂(log_2 𝑛) time in the worst case.

  4. D.

    Every BST is also a Min-Heap.

Attempted by 316 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…