235. Lowest Common Ancestor of a Binary Search Tree easy題
越來越熟練囉
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root->val > p->val && root->val > q->val){
return lowestCommonAncestor(root->left, p, q);
}
else if (root->val < q->val && root->val < p->val){
return lowestCommonAncestor(root->right, p, q);
}
return root;
}
};