What is the algorithm to find the Lowest Common Ancestor in a BST?

Question Explain

This problem asks for the lowest common ancestor of two nodes in a Binary Search Tree. It leverages the unique ordering property of BSTs.