How do you search for a value in a binary search tree?
PICTURE THIS: HOW TO EXPLAIN IT
Simple meaning
From the root, go left if the target is smaller and right if it is larger, until you hit the node or null.
WHY — BST instead of guessing?
Why interviewers care about BST:
question about BST.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1From the root, go
left if the target is smaller and right if it is larger, until you hit the node or null.
- 2Time is O(h) and
extra space is O(1) iteratively or O(h) recursively.
- 3Contrast with O(n) search
on an unordered binary tree.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
From the root, go left if the target is smaller and right if it is larger, until you hit the node or null. Time is O(h) and extra space is O(1) iteratively or O(h) recursively.