Inorder Traversal

1. Traverse the left subtree.
2. Visit the root.
3. Traverse the right subtree.

For Binary Search Tree (BST) we can retrieve all the data in sorted order using in-order traversal.

94. Binary Tree Inorder Traversal