searching to perform operation find(kin dictionary that is represented with binary search tree twe view the tree as decision tree (recall figure in this casethe question asked at each internal node of is whether the search key is less thanequal toor greater than the key stored at node vdenoted with key(vif the answer is "smaller,then the search continues in the left subtree if the answer is "equal,then the search terminates successfully if the answer is "greater,then the search continues in the right subtree finallyif we reach an external nodethen the search terminates unsuccessfully (see figure figure (aa binary search tree representing dictionary with integer keys(bnodes of visited when executing operations find( (successfuland find( (unsuccessfulon for simplicitywe show keys but entry values we describe this approach in detail in code fragment given search key and node of tthis methodtreesearchreturns node (positionw of the subtree (vof rooted at vsuch that one of the following occursw is an internal node and ' entry has key equal to is an external node representing ' proper place in an inorder traversal of ( )but is not key contained in (vthusmethod find(kcan be performed by calling treesearch(kt root()let be the node of returned by this call if is an internal nodethen we return ' entryotherwisewe return null code fragment search tree recursive search in binary