algorithm parentheticrepresentation note the use of the operator to concatenate two strings we explore modification to code fragment in exercise - to display tree in fashion more closely matching that given in figure postorder traversal another important tree traversal algorithm is the postorder traversal this algorithm can be viewed as the opposite of the preorder traversalbecause it recursively traverses the subtrees rooted at the children of the root firstand then visits the root it is similar to the preorder traversalhoweverin that we use it to solve particular problem by specializing an action associated with the "visitof node stillas with the preorder traversalif the tree is orderedwe make recursive calls for the children of node according to their specified order pseudo-code for the postorder traversal is given in code fragment code fragment algorithm postorder for performing the postorder traversal of the subtree of tree rooted at node