In a Binary Search Tree, where are values smaller than the root generally stored?

Options

  • A. Right subtree
  • B. Left subtree
  • C. Both sides randomly
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

B. Left subtree

Detailed Explanation

In a standard Binary Search Tree (BST), values smaller than a node are placed in its left subtree, while values greater than the node are placed in its right subtree. This ordering property makes searching, insertion, and deletion efficient when the tree remains reasonably balanced. An inorder traversal of a valid BST visits the keys in sorted order. In the worst case, an unbalanced BST can have O(n) search complexity.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts