Lowest Common Ancestor of a BST

Given the root of a binary search tree and two values `p` and `q` that both exist in it, return the value of their lowest common ancestor (the deepest node that has both in its subtree).

Examples

in: root = [6,2,8,0,4,7,9], p = 2, q = 8

out: 6

they split at the root

in: root = [6,2,8,0,4,7,9], p = 2, q = 4

out: 2

2 is an ancestor of 4

Constraints

2 <= number of nodes <= 10^5
all node values are unique
p and q exist

Hints

target: O(height) time⌘↩ run · ⇧⌘↩ submit