题目中需要寻找的是“最近的”公共祖先。
要注意题目中给出的条件,二叉搜索树。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
while(root != null){
if(root.val>p.val && root.val>q.val){
root = root.left;
}else if(root.val<p.val && root.val<q.val){
root = root.right;
}else{
break;
}
}
return root;
}
}