Question: Which of the following is true about a binary search tree (BST)?

Options:

1. Inorder traversal gives sorted order
2. Preorder traversal gives sorted order
3. Postorder traversal gives sorted order
4. Level order traversal gives sorted order

Correct Answer: Inorder traversal gives sorted order

Solution:

In a binary search tree, an inorder traversal visits nodes in non-decreasing order, thus giving a sorted order.