[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.
题意：
给定一棵二叉搜索树，以及两个节点，寻找着两个节点的最近的公共祖先节点。
思路：
考虑到这棵树比较特别，是一棵二叉搜索树，二叉搜索树的特点是根节点的左子树的节点的值都比根节点的值小，根节点右子树的值都比根节点大。所以找到的最近公共祖先节点，其值一定大于等于这两个节点的较小值，一定小于等于这两个节点的较大值。如果当前跟节点比这两个节点的较小值还小，说明这两个节点一定在根节点的右子树上，那么转移根节点到其右孩子。同理若根节点的值比较大者还要大，则转移到根节点的左孩子上去。

以上所述，代码如下：

/**
 * 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 || p == NULL || q == NULL)return NULL;
        int big = (p->val > q->val)?p->val:q->val;
        int small = (p->val < q->val)?p->val:q->val;
        while(root != NULL && !(root->val >= small && root->val <= big)) {
            if(root->val > big)root = root->left;
            else if(root->val < small)root = root->right;
        }
        return root;
    }
};