Many tree questions ask how two nodes are related, such as the shared manager of two employees or the distance between two nodes. The lowest common ancestor is the deepest node that has both in its subtree. For a BST you can use the ordering and walk down from the root, while a general binary tree needs one recursive search. It is a very common interview question and a building block for path and distance problems.