notes boolean search(tnode *pint valboolean anstnode *temptemp pans falsewhile ((temp !null&(!ans)if(temp->data =valans trueelse if(temp->data valtemp temp->leftelse temp temp->right deletion of node from binary search tree there is another simple situationsuppose the node we're deleting has only one subtree in the following example' has only subtree to delete node with subtreewe just `link pastthe nodei connect the parent of the node directly to the node' only subtree this always workswhether the one subtree is on the left or on the right deleting ` gives usl lovely professional university