In Order Traversal
- traverse the left subtree
- process the value in the node
- traverse the right subtree
-
Always examines the values in ascending order
If a search program printed each value in step 2, it
would produce the following list for the tree example used earlier :
6, 13, 17, 27, 33, 42, 48