Solution: Lowest Common Ancestor of a Binary Search Tree
Let's solve the Lowest Common Ancestor of a Binary Search Tree problem using the Tree Depth-first Search pattern.
We'll cover the following...
We'll cover the following...
Statement
Given a binary search tree with nodes, your task is to find the lowest common ancestor of two of its nodes, node1 and node2 ...