【LeetCode】235.Lowest Common Ancestor of a Binary Search Tree(Easy)解题报告
题目地址: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/
题目描述:
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.
求二叉搜索树的最近公共祖先。
Solution:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
利用二叉搜索树的性质:左孩子比中间小,右孩子比中间大
time : O(n)
space : O(n)
*/
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);
}else if(root.val > p.val && root.val >q.val){
return lowestCommonAncestor(root.left,p,q);
}else{
return root;
}
}
}
Date:2018年3月11日