LeetCode 235 Lowest Common Ancestor of BST - Implementation

Navigate using BST property. Split point is the LCA.

function lowestCommonAncestor(root, p, q): while root: if p.val < root.val and q.val < root.val: root = root.left elif p.val > root.val and q.val > root.val: root = root.right else: return root

$O(h)$ time, $O(1)$ space.