Question: Which of the following traversal methods can be used to obtain a sorted order of a binary search tree?
Options:
Correct Answer: In-order
Solution:
In-order traversal of a binary search tree visits nodes in sorted order, as it processes the left subtree, then the root, and finally the right subtree.