binary trees now we're back to inorder( )just returning from traversing ' left child we visit and then call inorder(again with as an argumentcreating inorder(clike inorder( )inorder(chas no childrenso step returns with no actionstep visits cand step returns with no action inorder(bnow returns to inorder(ahoweverinorder(ais now doneso it returns and the entire traversal is complete the order in which the nodes were visited is abcthey have been visited inorder in binary search tree this would be the order of ascending keys more complex trees are handled similarly the inorder(function calls itself for each nodeuntil it has worked its way through the entire tree traversing with the workshop applet to see what traversal looks like with the workshop appletrepeatedly press the trav button (you don' need to type in any numbers here' what happens when you use the tree workshop applet to traverse inorder the tree shown in figure this is slightly more complex than the three-node tree seen previously the red arrow starts at the root table shows the sequence of node keys and the corresponding messages the key sequence is displayed at the bottom of the workshop applet screen visit visit visit visit visit figure traversing tree inorder