Which of the following is/are correct in order traversal sequence(s) of binary search tree(s)?
In $Inorder$ traversal first left node is printed then root node and finally right node. $Left Node -> Root Node -> Right Node$
In a BST, $Left Node=< Root Node < Right Node$ Hence, Inorder always traverses the BST in ascending order.
In order traversal of key are always in ascending order.
So, here I & IV th sequence are in ascending order so Option A is Answer.