In-Order Traversal

In-order traversal is a tree traversal algorithm that visits the left subtree, the root, and then the right subtree. This is the most common way to traverse a binary search tree. It is also used to create a sorted list of nodes in a binary search tree.

Visit the following resources to learn more:

• Tree | Illustrated Data Structures
• Tree Traversals (Inorder, Preorder and Postorder)