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.
题意
找到两个节点的最近共同父节点。
思路
由于这个数是搜索二叉树,所以我的思路是判断给定节点与根节点的大小关系,然后再去相应的子树上去找,我是打算先去找p的父节点,然后再去
找q的父节点,然后记录各自父节点路径,然后去对比找到共同父节点。但是这样有点麻烦。看到别人的方法,感觉自己还是在思路深度上还是有所欠缺。
1. 如果两个数分别在根节点的两边,则共同父节点就是根节点;
2. 否则去根节点的左子树或右子树去找。
通过上面两个条件可以在二叉搜索树的前提下,找到两个节点的最近父节点。
代码
代码一:
public class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root == null || p == null || q== null)
return null;
if(Math.max(p.val, q.val) < root.val){
return lowestCommonAncestor(root.left,p,q);
}else if(Math.min(p.val, q.val) > root.val){
return lowestCommonAncestor(root.right,p,q);
}else{
return root;
}
}
}
代码二:
public class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root==null)
return null;
/* if(root.val==p.val)
return root;
if(root.val==q.val)
return root;*/
if(root.val>p.val&&root.val>q.val)
return lowestCommonAncestor(root.left,p,q);
if(root.val<p.val&&root.val<q.val)
return lowestCommonAncestor(root.right,p,q);
return root;
}
}