In Order Traversal In Binary Tree

In Order Traversal In Binary Tree

1. Its LNR ordered traversal.
2. The order goes this way:
   1. L: Traverse the left sub tree.
   2. N: visit the node
   3. R: Traverse the right sub tree.
3. Lets check with an example. Consider the following example.
   
   1. • Traverse the left sub tree of node 1
      • Traverse the left sub tree of node 2
      • Visit the node 4
      • Visit the node 2
      • Traverse the right sub tree of node 2
      • Visit the node 5
      • Visit the node 1
      • Traverse the right sub tree of node 1
      • Traverse the left subtree of node 3
      • Visit the node 6
      • Visit the node 3
      • Traverse the right sub tree of node 3
      • Visit the node 7
   2. On completing the traversal we get the in order if we follow the bolded nodes.
   3. In Order: 4 , 2 , 5 , 1 , 6 , 3 , 7