Answer:
The inorder traversal make a binary search tree sorted.
Explanation:
The algorithm of inorder traversal is
1. Traverse the left subtree.
2. print the data .
3. Traverse the right subtree
In this algorithm left subtree is visited first then it print the data or visit the data and finally it visited Right subtree .
