Which traversal of a Binary Search Tree produces the keys in sorted 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 standard Binary Search Tree produces its keys in ascending order. Inorder follows the sequence Left → Root → Right. Since all keys in the left subtree are smaller and all keys in the right subtree are larger, visiting nodes in this order naturally produces sorted output. This property makes inorder traversal particularly useful for extracting sorted data from a BST.