what' all this got to do with preorder and postorder traversalslet' see what' involved for these other traversals the same three steps are used as for inorderbut in different sequence here' the sequence for preorder(method visit the node call itself to traverse the node' left subtree call itself to traverse the node' right subtree traversing the tree shown in figure using preorder would generate the expression * +bc this is called prefix notation one of the nice things about it is that parentheses are never requiredthe expression is unambiguous without them it means "apply the operator to the next two things in the expression these two things are and +bc the expression +bc means "apply to the next two things in the expression;which are and cso this last expression is + in inorder notation inserting that into the original expression * +bc (preordergives us *( +cin inorder the postorder traversal method contains the three steps arranged in yet another way call itself to traverse the node' left subtree call itself to traverse the node' right subtree visit the node for the tree in figure visiting the nodes with postorder traversal would generate the expression abc+this is called postfix notation as described in "stacks and queues,it means "apply the last operator in the expression*to the first and second things the first thing is aand the second thing is bcbcmeans "apply the last operator in the expression+to the first and second things the first thing is and the second thing is cso this gives us ( +cin infix inserting this in the original expression abc+(postfixgives us *( +cpostfix the code in listing contains methods for preorder and postorder traversalsas well as for inorder finding maximum and minimum values incidentallywe should note how easy it is to find the maximum and minimum values in binary search tree in factit' so easy we don' include it as an option in the workshop appletnor show code for it in listing stillit' important to understand how it works for the minimumgo to the left child of the rootthen go to the left child of that childand