Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways.
Following are the generally used ways for traversing trees.
Example Tree:
Depth First Traversals: (a) Inorder (Left, Root, Right) : 4 2 5 1 3 (b) Preorder (Root, Left, Right): 1 2 4 5 3 (c) Postorder (Left, Right, Root): 4 5 2 3 1
