In a binary search tree, which subtree of a node contains elements that are greater than the node’s value?

Options

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

Correct Answer (Detailed Explanation is Below)

B. Right subtree

Detailed Explanation

In a standard Binary Search Tree (BST), values smaller than a node are stored in its left subtree, while values greater than the node are stored in its right subtree. This ordering property is called the BST property. It allows searching, insertion, and deletion to be performed efficiently when the tree is reasonably balanced. For a balanced BST, these operations can typically take O(log n) time.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts