力扣-235题 二叉搜索树的最近公共祖先（C++）- 牢记二叉搜索树的特性

题目链接：https://leetcode-cn.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:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root==NULL) return NULL;
        //公共祖先：即根节点大于左节点，小于右节点

        if(p->val < root->val&&q->val < root->val)//当前节点大于左右节点
            return lowestCommonAncestor(root->left,p,q);

        if(p->val > root->val&&q->val > root->val)//当前节点小于左右节点
            return lowestCommonAncestor(root->right,p,q);

        return root;
    }
};