Binary Search Tree Visualizers

5

Step through every Binary Search Tree problem with animated runtime state, source highlighting, and curated test cases. Built for coding-interview prep and durable algorithmic intuition.

Insert into a Binary Search Tree

Traverse the BST search path until the first empty child slot appears, then insert there.

Directed BST Insertion

Kth Smallest Element in a BST

Use in-order traversal so the kth visited node is the kth smallest BST value.

In-Order Traversal

Lowest Common Ancestor of a Binary Search Tree

Walk downward until the current node becomes the first split point between p and q.

BST Split Point

Search in a Binary Search Tree

Compare the target with the current node and follow the only subtree that can still contain it.

BST Directed Search

Validate Binary Search Tree

Carry valid lower and upper bounds down the tree to verify every node respects BST ordering.

Recursive Bounds