转载出处 http://blog.csdn.net/xudli/article/details/46838747
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.
Subscribe to see which companies asked this question
binary search tree (BST)的定义:http://www.linuxidc.com/Linux/2013-01/78410.htm
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;
}
}