postorder traversal another important tree traversal algorithm is the postorder traversal in some sensethis 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 (hencethe name "postorder"pseudo-code for the postorder traversal is given in code fragment and an example of postorder traversal is portrayed in figure algorithm postorder(tp)for each child in children(pdo postorder(tc{recursively traverse the subtree rooted at cperform the "visitaction for position code fragment algorithm postorder for performing the postorder traversal of subtree rooted at position of tree paper title abstract ss ss ss ss ss ss ss ss ss references ss figure postorder traversal of the ordered tree of figure running-time analysis both preorder and postorder traversal algorithms are efficient ways to access all the positions of tree the analysis of either of these traversal algorithms is similar to that of algorithm height given in code fragment of section at each position pthe nonrecursive part of the traversal algorithm requires time ( )where is the number of children of punder the assumption that the "visititself takes ( time by proposition the overall running time for the traversal of tree is ( )where is the number of positions in the tree this running time is asymptotically optimal since the traversal must visit all the positions of the tree