Answer :
Answer:
The answer of the given question is Inorder.
Explanation:
In the inorder traversal the binary tree start from the root and visited all the vertex in the tree .
The inorder follow the following Algorithm
1. Traverse in the left subtree.
2 Print the data (visit the node ).
3 Traverse in the Right subtree.