notes wherel stands for traversing the left sub-treer stands for traversing the right sub-treeand stands for processing the data of the node thereforethe order ldr is the order of traversal in which we start with the root nodevisit the left sub-tree firstthen process the data of the root nodeand then go for visiting the right subtree since the leftas well as right sub-trees are also the binary treesthe same procedure is used recursively while visiting the left and right sub-trees the order ldr is called inorderthe order lrd is called postorderand the order dlr is called preorder the remaining three orders are not used if the processing that we do with the data in the node of tree during the traversal is simply printing the data valuethen the output generated for tree given below in figure using the inorderpreorder and postorder is the one shown below in figure itself figure binary tree along with its inorderpreorder and postorder different order path in figure areinorderdbheiafcg preorderabdehicfg postorderdhiebfgca if an expression is represented as binary tree then the inorder traversal of the tree gives us an infix expressionwhereas the postorder traversal gives us posfix expression as shown below in figure figure binary tree of an expression along with its inorder and postorder lovely professional university