题解 | #二叉搜索树的最近公共祖先#

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param root TreeNode类 
 * @param p int整型 
 * @param q int整型 
 * @return int整型
 */
int lowestCommonAncestor(struct TreeNode* root, int p, int q)
{
    int newp = p > q ? p : q;
    int newq = p < q ? p : q;
    if(newp>=root->val&&newq<=root->val)
    {
        return root->val;
    }
    while (newp < root->val||newq>root->val)
    {
        if (newp > root->val)
        {
            root = root->right;
        }
        else
        {
            root = root->left;
        }
    }
    return root->val;
}