LeetCode235. Lowest Common Ancestor of a Binary Search Tree

题目链接

求二叉搜索树的最近公共祖先（LCA）。

class Solution {public:    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {        while(1){            if(root->val > max(p->val, q->val)) root = root->left;            else if(root->val < min(p->val, q->val)) root = root->right;            else return root;        }    }};