1 题目描述
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.
2 解题思路
2.1题目属于二叉排序树,因此左右节点一定小于其父几点。
2.2本题木采用递归的方法,在递归中只对符合条件的子树进行递归,而不需要另一个子树进行递归。
3 源代码
package com.larry.easy;
import com.larry.util.TreeNode;
public class LowestCommonAncestorOfABinarySearchTree {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
int val = root.val;
int max = Math.max(p.val, q.val);
int min = Math.min(p.val, q.val);
if(val >= min && val <= max)
return root;
else if(val > max) return lowestCommonAncestor(root.left, p, q);
else return lowestCommonAncestor(root.right, p, q);
}
}