A traversal of a graph is an algorithm or process for "visiting" all of the vertices in a tree in a specified order that is determined by the graph structure. Tree traversals are traversals that are defined in the special case that the graph is a rooted tree.
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.
In-order Traversal. In this traversal method, the left subtree is visited first, then the root and later the right sub-tree. ...
Pre-order Traversal. ...
Post-order Traversal.
