figure binary tree after deletion of node pointed to by notes nil nil nil search for key in bst to search the binary tree for particular nodewe use procedures similar to those we used when adding to it beginning at the root nodethe current node and the entered key are compared if the values are equal success is output if the entered value is less than the value in the nodethen it must be in the left-child sub tree if there is no left-child sub treethe value is not in the tree failure is reported if there is left-child subtreethen it is examined the same way similarlyit the entered value is greater than the value in the current nodethe right child is searched figure shows the path through the tree followed in the search for the key figure search for key in bst find-key (key valuenodeif (two values are sameprint value stored in nodereturn (success)else if (key value value stored in current nodeif (left child existsfind-key (key-valueleft hand)lovely professional university