Which traversal of a Binary Search Tree produces elements in sorted order?

Options

  • A. Preorder
  • B. Postorder
  • C. Inorder
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

C. Inorder

Detailed Explanation

Inorder traversal of a Binary Search Tree visits nodes in the order Left subtree → Root → Right subtree. Because smaller values are on the left and larger values are on the right, inorder traversal produces the elements in ascending sorted order when the BST contains distinct values. This is an important property frequently asked in exams. Preorder follows Root-Left-Right, while postorder follows Left-Right-Root and does not generally produce sorted output.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts