leetcode 235. 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, since a node can be a descendant of itself according to the LCA definition.

AC解，C++代码，菜鸟一个，请大家多多指正

/**
 * 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 (p->val <= root->val && q->val >= root->val || p->val >= root->val && q->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);
       }
    }
};