In a binary search tree, where are values smaller than a node generally stored?

Options

  • A. Left subtree
  • B. Right subtree
  • C. Root only
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

A. Left subtree

Detailed Explanation

The left subtree of a node in a standard Binary Search Tree contains values smaller than the node value. Similarly, the right subtree contains greater values. This recursive ordering applies throughout the tree, not just to the immediate children. For example, if a node contains 50, values less than 50 are placed toward its left side and values greater than 50 toward its right side. This property makes BST searching more efficient than an unordered binary tree.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts