Which traversal of a Binary Search Tree always produces the elements in ascending 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

The inorder traversal of a Binary Search Tree produces its elements in sorted ascending order, provided the BST follows the standard rule of smaller values on the left and larger values on the right. Inorder traversal follows Left → Root → Right. This property is frequently used to verify whether a given traversal represents a valid BST and is an important distinction between preorder, inorder and postorder traversals.