Lowest Common Ancestor of a Binary Search Tree

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(2,4 的最小祖先为2), since a node can be a descendant of itself according to the LCA definition.

用最简单的思路：
递归：

TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (root == NULL)
            return NULL;
        if(root->val > p->val && root->val > q->val)
            return lowestCommonAncestor(root->left, p, q);
        else if(root->val < p->val && root->val < q->val)
            return lowestCommonAncestor(root->right, p, q);
        else return root;
    }

//44ms
非递归：
法1：

TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL)
            return NULL;
        while (root){
            if (root->val > p->val && root->val > q->val)
                root = root->left;
            else if(root->val < p->val && root->val < q->val)
                root = root->right;
            else return root;
        }
    }

//44ms
法2：
栈，比较复杂，但思路比较有意思。

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL)
            return NULL;
        vector<TreeNode*> v1, v2;
        find(root,p,v1);
        find(root,q,v2);
        TreeNode* lowest = NULL;
        int len = min(v1.size(),v2.size());//最小值判断
        for(int i=0; i<len; i++){
            if(v1[i] == v2[i])
                lowest = v1[i];
            else break;
        }
        return lowest;
    }
    void find(TreeNode* root, TreeNode* p, vector<TreeNode*> &v){//记得带上&
        if(root == NULL)
            return;
        if(root == p){
            v.push_back(root);
            return;
        }
        v.push_back(root);
        find(root->left, p,v);//找到左结点的路径
        if(v[v.size()-1] == p)
            return;
        v.pop_back();

        v.push_back(root);
        find(root->right, p,v);//找到右结点的路径
        if(v[v.size()-1] == p)
            return;
        v.pop_back();
    }
};

//48ms