Which of the following traversal methods can be used to obtain a sorted sequence of elements in a binary search tree?PreorderPostorderLevel orderInorder

The traversal method that can be used to obtain a sorted sequence of elements in a binary search tree is the Inorder traversal.

Here's why:

1. Preorder Traversal: In this method, the order of traversal is Root, Left, Right. This does not guarantee a sorted sequence in a binary search tree.

2. Postorder Traversal: In this method, the order of traversal is Left, Right, Root. This also does not guarantee a sorted sequence in a binary search tree.

3. Level Order Traversal: This method traverses the tree level by level. This also does not guarantee a sorted sequence in a binary search tree.

4. Inorder Traversal: In this method, the order of traversal is Left, Root, Right. When used on a binary search tree, this method will give a sorted sequence of elements. This is because for every node, all the elements in the left subtree are less, and all the elements in the right subtree are more than the node. So, traversing first through the left (smaller elements), then the root (middle element), and finally the right (larger elements) will give a sorted sequence.