When we are searching a new node in a binary search tree, we have to consider the following steps:
- Start with the root node and set it as the current node.
- If the current node is empty, return false.
- If the current node value is the search value, return true.
- Check whether the searching value is less than the current node or more.
- If less, go to the left and set the left as the current node.
- If more, go to the right and set the right as the current node.
- Continue to step 3 until all the nodes are visited.