that we use the fact that an arithmetic expression tree is proper binary tree code fragment algorithm evaluateexpression for evaluating the expression represented by the subtree of an arithmetic expression tree rooted at node the expression-tree evaluation application of the postorder traversal provides an ( )-time algorithm for evaluating an arithmetic expression represented by binary tree with nodes indeedlike the general postorder traversalthe postorder traversal for binary trees can be applied to other "bottom-upevaluation problems (such as the size computation given in example as well inorder traversal of binary tree an additional traversal method for binary tree is the inorder traversal in this traversalwe visit node between the recursive traversals of its left and right subtrees the inorder traversal of the subtree rooted at node in binary tree is given in code fragment code fragment algorithm inorder for performing the inorder traversal of the subtree of binary tree rooted at node