Lowest Common Ancestor in a BST

Question

## Problem

Find the LCA of two nodes in a binary search tree without recursion.

## Example
```
BST; LCA splits where p and q diverge
```

## Constraints
- Nodes exist in the tree

## Approach
Walk down: go left/right based on values until the split point. O(h).