Binary Tree Traversal (Inorder, Preorder and Postorder) SAMPLE EXERCISES

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.

Traversal is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (links) we always start from the root (head) node. That is, we cannot randomly access a node in a tree (Inorder, Preorder and Postorder). Generally, we traverse a tree to search or locate a given item or key in the tree or to print all the values it contains.