This visualization demonstrates how to find the Lowest Common Ancestor (LCA) in a Binary Search Tree (BST) using the Split Point approach. The Split Point is the first node encountered where the two values we're searching for split in different directions.
Let's find the Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree.