What are the steps when searching for a value in a binary search tree?

$\backslash$table$[[$If the comparison$],[$does not equate,$],[$verify if the$],[$searched$-$for value is$],[$less than or greater$],[$than the root node is equal,$],[$return$]]$

$\backslash$table$[[$Assuming the$],[$searched for value is$],[$less$,$ traverse down$],[$the left side of the$],[$tree$]]$

the root node on the

left side

$$ I don't know

$2$ attempts