tree traversaltraversal is process to visit all the nodes of tree and may print their values too becauseall nodes are connected via edges (linkswe always start from the root (headnode that iswe cannot randomly access node in tree there are three ways which we use to traverse tree in-order traversal pre-order traversal post-order traversal generallywe traverse tree to search or locate given item or key in the tree or to print all the values it contains in-order traversal in this traversal methodthe left subtree is visited firstthen the root and later the right sub-tree we should always remember that every node may represent subtree itself if binary tree is traversed in-orderthe output will produce sorted key values in an ascending order we start from aand following in-order traversalwe move to its left subtree is also traversed in-order the process goes on until all the nodes are visited the output of inorder traversal of this tree will be - - - - - -