1. Current node
Start searching at the root.
let node = rootTyporithm · medium
Binary Search Tree Search
▷ Interactive algorithm labbinary-search-tree-searchsearchtreebinary-search-treebranching
Saved on this device
Full lesson · 8 learning steps Open any exercise for focused practice
10%
Step 1 of 8 · intro card
Learn Binary Search Tree Search
Search Algorithms
Binary Search Tree Search follows left or right child pointers based on the BST ordering rule.
A BST stores smaller values in the left subtree and larger values in the right subtree.
At each node, compare target with node.value.
A smaller target moves left; a larger target moves right.
Search stops when the value is found or a null child is reached.
Preparing algorithm lab…
01
Start at the root.
02
Compare target with node.value.
03
Go left for smaller values.
04
Go right for larger values.
05
Balanced trees search in O(log n).
function bstSearch(root, target) {
let node = root;
while (node) {
if (node.value === target) return node;
if (target < node.value) {
node = node.left;
} else {
node = node.right;
}
}
return null;
}Read the implementation
Connect each part of the code to the concept before you type.
2. Walk tree
Keep going while there is a node to inspect.
while (node)3. Found node
Return the node when its value matches target.
if (node.value === target) return node4. Go left
Smaller target values must be in the left subtree.
target < node.value5. Move left
Follow the left child pointer.
node = node.left6. Move right
Follow the right child pointer for larger targets.
node = node.right7. Not found
A missing child means the target is not in the tree.
return nullA complete learning loop
01
Understand
Read the concept map and follow the code breakdown.
02
Reconstruct
Type the implementation, repair mistakes and work through every recall exercise.
03
Verify
Use the final check without hints; revisit weak concepts in short practice sessions.