subtree subtree subtree null (abstinsert(root, (bbstinsert(subtree left,key (cbstinsert(subtree right,key subtree (dbstinsert(subtree left,key (esubtree treenode(key (fsubtree left bstinsertroot (gsubtree right bstinsert subtree subtree subtree subtree (hsubtree left bstinsert (iroot bstinsertfigure the recursive steps of the _bstinsert(method when inserting into the binary search tree each tree shows the results after performing the indicated instruction the treethe root of the current subtree will be the node of interest to insert key value the method must search for its ultimate location by recursively navigating deeper into the tree following either the left or right branch at each node as appropriate these recursive steps are shown in parts ( cof figure the gray nodes indicate the root of the subtree currently being processed by the current invocation of the method the dashed lines indicate the direction we must follow to find the correct path through the tree and then the path followed during the unwinding of the recursion