LeetCode 0235 Lowest Common Ancestor of a Binary Search Tree【二叉搜索树，LCA】

最新推荐文章于 2020-05-09 15:52:27 发布

原创最新推荐文章于 2020-05-09 15:52:27 发布 · 315 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一种在二叉搜索树中寻找两个指定节点的最近公共祖先的方法。通过判断目标节点与当前节点的关系，决定搜索路径，最终找到最近公共祖先节点。示例展示了在特定二叉搜索树中，不同节点组合下的最近公共祖先。

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.

题意

二叉搜索树的最近公共祖先

思路1

若p和q两个结点在当前根节点两侧，则当前根结点为所求
否则在两边子树中分别求

代码1

/**
 * 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 *ans;
        if((root->val <= p->val && root->val >= q->val) || (root->val >= p->val && root->val <= q->val))
            return root;   
        else if(root->val > p->val)
            ans = lowestCommonAncestor(root->left, p, q);
        else
            ans = lowestCommonAncestor(root->right, p, q);
        return ans;
    }
};