searching searching bst is even simpler than insertion the pseudocode is self-explanatory but we will look briefly at the premise of the algorithm nonetheless we have talked previously about insertionwe go either left or right with the right subtree containing values that are > where is the value of the node we are inserting when searching the rules are made little more atomic and at any one time we have four cases to consider the root in which case value is not in the bstor root value value in which case value is in the bstor value root valuewe must inspect the left subtree of root for valueor value root valuewe must inspect the right subtree of root for value algorithm contains(rootvalue preroot is the root node of the treevalue is what we would like to locate postvalue is either located or not if root return false end if if root value value return true else if value root value return contains(root leftvalue else return contains(root rightvalue end if end contains