Lowest Common Ancestor of a Binary Search Tree
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.
题目大意:
求两个节点的最近公共祖先
思路:
由于是BST树,因此有一个规律:最近公共祖先的值,一定在两个节点之间。比如对于节点2和8的公共祖先6 就有:2 < 6 < 8。同理,对于节点5和9,有5<6<9。有了这个规律,从根节点开始向下遍历即可,当发现当前节点的值在v和w之间,直接返回当前节点。
如果不是BST树,需要后续遍历,请见:http://blog.csdn.net/u010429424/article/details/77650420
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
if(root.val < p.val && root.val < q.val) {
return lowestCommonAncestor(root.right, p, q);
}
if(root.val > p.val && root.val > q.val) {
return lowestCommonAncestor(root.left, p, q);
}
return root;
}
}
注:学渣心里苦,不要学楼主,平时不努力,考试二百五,哭~