Lowest Common Ancestor of a Binary Search Tree

https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/

由于是二叉排序树，所以可以先确定一个搜索函数，方便构造出一个数组用于存放搜寻路径

之后再搜索路径中查找到最后重复的节点即可。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */


class Solution {
public:
    void getPath(TreeNode * root,TreeNode * p,vector<TreeNode *> & path)
    {
        TreeNode * temp=root;
        while(temp!=NULL)
        {
            path.push_back(temp);
            if(p->val==temp->val)
                break;
            else if(p->val>temp->val)
                temp=temp->right;
            else
                temp=temp->left;
        }
    }
    int min(int a,int b)
    {
        return a<b?a:b;
    }
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
            
            vector<TreeNode *> path1;
            vector<TreeNode *> path2;
            getPath(root,p,path1);
            getPath(root,q,path2);
            int size1=path1.size();
            int size2=path2.size();
            int i=0;
            TreeNode * res=root;
            for(;i<size1&&i<size2;i++)
            {
                if(path1.at(i)->val==path2.at(i)->val)
                {
                    res=path1.at(i);
                }
                else
                    break;
            }
            return res;
                
    }
};