eetcode_c++:树:Lowest Common Ancestor of a Binary Search Tree（235）

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 v and w as the lowest node in T that has both v and w as descendants (where we allow a node to be a descendant of itself).”

          ____6______
       /              \
    ___2__          ___8__
   /      \        /      \
   0      _4       7       9
         /  \
         3   5

For example, the lowest common ancestor (LCA) of nodes 2 and 8 is 6. Another example is LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.

---

求一个搜索二叉树的 LCA（最近公共祖先）。

分析：

可以利用二叉树的性质做，只要从根节点向下找，如果 leftval <= sub_root.val <= rightval，那 sub_root 就是他们的 LCA。
可以用递归做，也可以迭代做。

---

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if((p->val <= root->val && q->val >= root->val) || (q->val <= root->val && p->val >= root->val)) {
            return root;
        } else if(p->val < root->val && q->val < root->val) {
            return lowestCommonAncestor(root->left, p, q);
        } else {
            return lowestCommonAncestor(root->right, p, q);
        }
    }
};