let' look at simple example to get an idea of how this recursive traversal routine works imagine traversing tree with only three nodesa root (awith left child (band right child ( )as shown in figure figure inorder(method applied to -node tree we start by calling inorder(with the root as an argument this incarnation of inorder(we'll call inorder(ainorder(afirst calls inorder(with its left childbas an argument this second incarnation of inorder(we'll call inorder(binorder(bnow calls itself with its left child as an argument howeverit has no left childso this argument is null this creates an invocation of inorder(we could call inorder(nullthere are now three instances of inorder(in existenceinorder( )inorder( )and inorder(nullhoweverinorder(nullreturns immediately when it finds its argument is null (we all have days like that now inorder(bgoes on to visit bwe'll assume this means to display it then inorder(bcalls inorder(againwith its right child as an argument again this argument is nullso the second inorder(nullreturns immediately now inorder(bhas carried out steps and so it returns (and thereby ceases to existnow we're back to inorder( )just returning from traversing ' left child we visit aand 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