The document discusses three methods for traversing a tree: in-order, pre-order, and post-order traversal. In-order traversal visits the left subtree, then the root, then the right subtree. Pre-order visits the root, left subtree, then right subtree. Post-order visits the left subtree, right subtree, then the root. Examples are provided to demonstrate the output of each traversal type on a sample tree.

1. Traversal of Tree
Presented by: Saket Bhala

2. Definition
• 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 random
access a node in tree.
There are three ways which
we use to traverse a tree-

3. Traversal of Tree
In-Order
Pre-
Order
Post-
Order

4. In-Order Traversal
• In this traversal method, the left sub-tree is visited
first, then root and then the right sub- tree.

5. In-Order Traversal
• E.g.
Continue…..
=
S
+
*
+
DCBA

6. Output: S
=
S
+
*
+
DCBA
In-Order Traversal

7. Output: S=
=
S
+
*
+
DCBA
In-Order Traversal

8. Output: S=A
=
S
+
*
+
DCBA
In-Order Traversal

9. Output: S=A+
=
S
+
*
+
DCBA
In-Order Traversal

10. Output: S=A+B
=
S
+
*
+
DCBA
In-Order Traversal

11. Output: S=A+B*
=
S
+
*
+
DCBA
In-Order Traversal

12. Output: S=A+B*C
=
S
+
*
+
DCBA
In-Order Traversal

13. Output: S=A+B*C+
=
S
+
*
+
DCBA
In-Order Traversal

14. Output: S=(A+B)*(C+D)
=
S
+
*
+
DCBA
In-Order Traversal

15. Pre-Order Traversal
• In this traversal method, the root node is visited
first, then left sub-tree and then finally right sub-
tree.

16. Pre-Order Traversal
• E.g.
Continue…..
=
S
+
*
+
DCBA

17. Output: =
=
S
+
*
+
DCBA
Pre-Order Traversal

18. Output: =S
=
S
+
*
+
DCBA
Pre-Order Traversal

19. Output: =S*
=
S
+
*
+
DCBA
Pre-Order Traversal

20. Output: =S*+
=
S
+
*
+
DCBA
Pre-Order Traversal

21. Output: =S*+A
=
S
+
*
+
DCBA
Pre-Order Traversal

22. Output: =S*+AB
=
S
+
*
+
DCBA
Pre-Order Traversal

23. Output: =S*+AB+
=
S
+
*
+
DCBA
Pre-Order Traversal

24. Output: =S*+AB+C
=
S
+
*
+
DCBA
Pre-Order Traversal

25. Output: =S*+AB+CD
=
S
+
*
+
DCBA
Pre-Order Traversal

26. Post-Order Traversal
• In this traversal method, first we traverse left
subtree, then right subtree and finally root.

27. Post-Order Traversal
• E.g.
Continue…..
=
S
+
*
+
DCBA

28. Output: S
=
S
+
*
+
DCBA
Post-Order Traversal

29. Output: SA
=
S
+
*
+
DCBA
Post-Order Traversal

30. Output: SAB
=
S
+
*
+
DCBA
Post-Order Traversal

31. Output: SAB+
=
S
+
*
+
DCBA
Post-Order Traversal

32. Output: SAB+C
=
S
+
*
+
DCBA
Post-Order Traversal

33. Output: SAB+CD
=
S
+
*
+
DCBA
Post-Order Traversal

34. Output: SAB+CD+
=
S
+
*
+
DCBA
Post-Order Traversal

35. Output: SAB+CD+*
=
S
+
*
+
DCBA
Post-Order Traversal

36. Output: SAB+CD+*=
=
S
+
*
+
DCBA
Post-Order Traversal

37. Operator Precedence
Associativity Individual Operator
Left to Right ( )
Right to Left
Right to Left *
Right to Left /
Right to Left %
Right to Left +
Right to Left -
Right to Left =

38. Reference
• https://www.tutorialspoint.com/data_structures_algorithms/tree_traversal.htm
Thank You