题目
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 p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).”
Given binary search tree: root = [6,2,8,0,4,7,9,null,null,3,5]
Example 1:
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
Output: 6
Explanation: The LCA of nodes 2 and 8 is 6.
Example 2:
Input: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
Output: 2
Explanation: The LCA of nodes 2 and 4 is 2, since a node can be a descendant of itself according to the LCA definition.
Note:
- All of the nodes' values will be unique.
- p and q are different and both values will exist in the BST.
解法思路(一)
- 如果 p 和 q 在 root 的两边,那么 root 就是 p 和 q 的最低的公共祖先,这种情况包含三种具体的情况:
- p 和 q 在 root 的两边;
- p 就是 root,q 在 root 的哪边不所谓;
- q 就是 root,p 在 root 的哪边不所谓;
- 如果不是上面的情况,p 和 q 要么全在 root 的左边,要么全在 root 的右边,这时只需递归的去 root 的左子树或右子树中找 p 和 q 的最低公共祖先;
解法实现(一)
时间复杂度
- O(logN),其中 N 为树的节点个数;
空间复杂度
- O(h),其中 h 为树的高度;
关键字
二分搜索树
递归
二分搜索树中节点的公共祖先
实现细节
- 注意
return root
时包含的三种情况; - 这道题包含的二分搜索树的性质很有意思;
package leetcode._235;
public class Solution235_1 {
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
assert p != null && q != null;
if (p.val < root.val && q.val < root.val) {
return lowestCommonAncestor(root.left, p, q);
}
if (p.val > root.val && q.val > root.val) {
return lowestCommonAncestor(root.right, p, q);
}
assert p.val == root.val || q.val == root.val
|| (root.val - p.val) * (root.val - q.val) < 0;
return root;
}
}