Easy
122288FavoriteShare
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 nodes2
and8
is6
.
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 nodes2
and4
is2
, 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.
迭代查找法:
Java:
/*
* @Author: SourDumplings
* @Date: 2019-08-27 21:33:12
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
*/
/**
* 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)
{
while (true)
{
if (p.val < root.val)
{
if (q.val < root.val)
{
root = root.left;
}
else
{
return root;
}
}
else if (p.val == root.val)
{
return root;
}
else
{
if (q.val > root.val)
{
root = root.right;
}
else
{
return root;
}
}
}
}
}
递归查找法:
C++:
/*
* @Author: SourDumplings
* @Date: 2019-08-27 20:59:41
* @Link: https://github.com/SourDumplings/
* @Email: changzheng300@foxmail.com
* @Description: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution
{
public:
TreeNode *lowestCommonAncestor(TreeNode *root, TreeNode *p, TreeNode *q)
{
TreeNode *res = nullptr;
search_in_bst(root, p, q, res);
return res;
}
void search_in_bst(TreeNode *root, TreeNode *p, TreeNode *q, TreeNode *&res)
{
if (p->val < root->val)
{
if (q->val < root->val)
{
search_in_bst(root->left, p, q, res);
}
else
{
res = root;
}
}
else if (p->val == root->val)
{
res = root;
}
else
{
if (q->val > root->val)
{
search_in_bst(root->right, p, q, res);
}
else
{
res = root;
}
}
}
};