- Much like 236, use recursion - If
q.val, it means we found the result.
- Base: we found the result -
[p.val, q.val](Assume p.val is smaller than q.val)
root.valis bigger than both of them, then we need to search in smaller values, whcih means we need to get into
- Likewise, do
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8