# 【Leetcode】Lowest Common Ancestor of a Binary Search Tree

262人阅读 评论(0)

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.

	public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if (root.val > p.val && root.val < q.val) { //p.val<root.val<q.val，则root是p/q的父结点
return root;
}
if (root.val > p.val && root.val > q.val) {//root.val>p.val,>q.val，则p/q最低祖先结点在root左子树
return lowestCommonAncestor(root.left, p, q);
}
if (root.val < p.val && root.val < q.val) {
return lowestCommonAncestor(root.right, p, q);
}
return root;
}

0
0

个人资料
• 访问：568325次
• 积分：8669
• 等级：
• 排名：第2679名
• 原创：305篇
• 转载：6篇
• 译文：0篇
• 评论：37条
博客专栏
 Leetcode题解java版 文章：289篇 阅读：490511
文章分类
阅读排行
最新评论