CODE EXAMPLE FOR JAVA

Inorder traversal Algorithm for binary tree

Until all nodes are traversed −
Step 1 − Recursively traverse left subtree.
Step 2 − Visit root node.
Step 3 − Recursively traverse right subtree.