最近祖先节点特点,大于小的那个,小于大的那个
/**
* 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>q->val) swap(p,q);
if(root->val>q->val) return lowestCommonAncestor(root->left,p,q);
if(root->val<p->val) return lowestCommonAncestor(root->right,p,q);
return root;
}
};