【题目概要】
235. 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 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.
【思路分析】
- 当两节点数值均大于根节点值时,遍历根右节点,反之均小于根节点时,遍历根左节点
- 当出现两节点值和根节点值一大一小的情况时,根节点即为LCA
- 普通二叉树的2节点最近公共祖先Lowest Common Ancestor参考文献
- 根节点为空,或递归后为空,返回NULL
- 若是任意1节点和根节点匹配,返回根节点
- 如果和根节点不匹配,递归在左右子树中寻找节点
- 如果某节点左子树存在一个节点,右子树也存在一个节点,在此节点为LCA
- 如果两个节点都位于左子树中,则LCA也位于左子树中,否则LCA位于右子树中,判断左右节点的值是否为空
【代码示例1】
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
【说明】利用迭代的方式,根据BST的特性,利用类似方法可以实现数值的查找等问题,注意此处的p和q不是一定的左右节点,大小上没有关系,因此在决定root向右还是向左的时候采用了极右和极左的情况
struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) {
int leftval = p->val;
int rightval = q->val;
while(root)
{
int key = root->val;
if(leftval > key && rightval > key)
root = root->right;
else if(leftval < key && rightval < key)
root = root->left;
else
break;
}
return root;
}
【代码示例2】
【说明】递归前是判断递归结束,递归后面是根据结果返回比较和修正的结果
struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) {
if(!root)
return NULL;
if(root == p || root == q)
return root;
struct TreeNode* left = lowestCommonAncestor(root->left, p, q);
struct TreeNode* right = lowestCommonAncestor(root->right, p, q);
if(left && right)
return root;
else
return left != NULL?left:right;
}