To traverse a non empty tree in inorder the following steps are followed recursively.
- Visit the Root
- Traverse the left subtree
- Traverse the right subtree
The inorder traversal of the tree shown below is as follows.
| Inorder Traversal : | |||||
To traverse a non empty tree in inorder the following steps are followed recursively.
The inorder traversal of the tree shown below is as follows.
|
|||||
| Prev | |||||