example for the trees given in example find the sequence of nodes that will be visited using in-order traversal algorithm traversal ordergdhlbeacifkand traversal orderbdaehgifand post-order traversal to traverse non-empty binary tree in post-orderthe following operations are performed recursively at each node the algorithm works by traversing the left sub-tree traversing the right sub-treeand finally visiting the root node consider the tree given in fig the post-order traversal of the tree is given as bcstep repeat steps to while tree !null and left sub-tree firstthe right sub-tree nextstep postorder(tree -leftand finally the root node in this algorithmthe step postorder(tree -rightleft sub-tree is always traversed before the right step write tree -data [end of loopsub-tree and the root node the word 'postin step end the post-order specifies that the root node is accessed after the left and the right sub-trees figure algorithm for post-order traversal post-order algorithm is also known as the lrn traversal algorithm (left-right-nodethe algorithm for post-order traversal is shown in fig post-order traversals are used to extract postfix notation from an expression tree example for the trees given in example give the sequence of nodes that will be visited using post-order traversal algorithm traversal orderglhdebikjfcand traversal orderdbhigfecand level-order traversal in level-order traversalall the nodes at level are accessed before going to the next level this algorithm is also called as the breadth-first traversal algorithm consider the trees given in fig and note the level order of these trees ( (btraversal orderaband traversal orderabcdefghijland figure binary trees (ctraversal orderabcdefghand