Correct answer: (B) An inorder traversal will always produce a sorted sequence of elements.
Explanation
Inorder traversal of a BST is always sorted. The maximum path length equals n-1 only for a skewed tree, and a skewed BST makes search O(n). A BST need not satisfy the heap property.
More Trees and Binary Search Trees questions
GATE 2025 CS (CS2) Q13– Consider a binary tree T in which every node has either zero or two children. Let n > 0 be…
GATE 2025 CS (CS2) Q35– Suppose the values 10, -4, 15, 30, 20, 5, 60, 19 are inserted in that order into an…
GATE 2025 CS (CS2) Q38– A meld operation on two instances of a data structure combines them into one single…
GATE 2024 CS (CS2) Q39– You are given a set V of distinct integers. A binary search tree T is created by inserting…
GATE 2023 CS Q47– Consider the C function foo and the binary tree shown. When foo is called with a pointer…
GATE 2021 CS (CS1) Q20– A binary search tree T contains n distinct elements. What is the time complexity of…