# leetcode 235: Lowest Common Ancestor of a Binary Search Tree

9806人阅读 评论(8)

### Lowest Common Ancestor of a Binary Search Tree

Total Accepted: 203 Total Submissions: 511

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 allowa 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.

[思路]

[CODE]

/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
//2, 1
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;
}
}

[CODE]

/**
* Definition for a binary tree node.
* public class TreeNode {
*     int val;
*     TreeNode left;
*     TreeNode right;
*     TreeNode(int x) { val = x; }
* }
*/
public class Solution {
//2, 1
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root==null || p==null || q==null) return null;

List<TreeNode> pathp = new ArrayList<>();
List<TreeNode> pathq = new ArrayList<>();

getPath(root, p, pathp);
getPath(root, q, pathq);

TreeNode lca = null;
for(int i=0; i<pathp.size() && i<pathq.size(); i++) {
if(pathp.get(i) == pathq.get(i)) lca = pathp.get(i);
else break;
}
return lca;
}

private boolean getPath(TreeNode root, TreeNode n, List<TreeNode> path) {
if(root==n) {
return true;
}

if(root.left!=null) {
if(getPath(root.left, n, path)) return true;
path.remove(path.size()-1);
}

if(root.right!=null) {
if(getPath(root.right, n, path)) return true;
path.remove(path.size()-1);
}

return false;
}
}

2
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：752913次
• 积分：10079
• 等级：
• 排名：第1701名
• 原创：276篇
• 转载：9篇
• 译文：0篇
• 评论：102条
文章分类
阅读排行
最新评论