sec binary search trees ( (bfigure two binary search trees for collection of values tree (aresults if values are inserted in the order tree (bresults if the same values are inserted in the order figure shows class declaration for the bst that implements the dictionary adt the public member functions include those required by the dictionary adtalong with constructor and destructor to find record with key value in bstbegin at the root if the root stores record with key value kthen the search is over if notthen we must search deeper in the tree what makes the bst efficient during search is that we need search only one of the node' two subtrees if is less than the root node' key valuewe search only the left subtree if is greater than the root node' key valuewe search only the right subtree this process continues until record with key value is foundor we reach leaf node if we reach leaf node without encountering kthen no record exists in the bst whose key value is example consider searching for the node with key value in the tree of figure (abecause is less than the root value of the search proceeds to the left subtree because is greater than we search in ' right subtree at this point the node containing is found if the search value were the same path would be followed to the node containing because this node has no childrenwe know that is not in the bst notice that in figure public member function find calls private member function named findhelp method find takes the search key as an explicit parameter and its bst as an implicit parameteralong with space to place copy of