leetcode系列236-二叉树的最近公共祖先

最新推荐文章于 2022-08-14 09:34:34 发布

HanWagner

最新推荐文章于 2022-08-14 09:34:34 发布

阅读量136

点赞数

分类专栏： LeetCode 文章标签：二叉树算法 leetcode 数据结构

本文链接：https://blog.csdn.net/qq_30286973/article/details/107367065

版权

LeetCode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

【题目概要】

236. Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.

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 the following binary tree:  root = [3,5,1,6,2,0,8,null,null,7,4]
Example 1:

Input: root = [3,5,1,6,2,0,8,null,null,7,4], p = 5, q = 1
Output: 3
Explanation: The LCA of nodes 5 and 1 is 3.

在这里插入图片描述
【思路分析】

分析这是需要找普通二叉树的最近公共祖先，BST树可以按照根节点值在所给节点值的中间大小来判别，反过来给出都在右子树和左子树的情况
统一的解法格式

若是任意1节点和根节点匹配，返回根节点
根节点为空，或递归后为空，返回NULL
如果和根节点不匹配，递归在左右子树中寻找节点
如果某节点左子树存在一个节点，右子树也存在一个节点，在此节点为LCA
如果两个节点都位于左子树中，则LCA也位于左子树中，否则LCA位于右子树中，判断左右节点的值是否为空

【代码示例】

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
struct TreeNode* lowestCommonAncestor(struct TreeNode* root, struct TreeNode* p, struct TreeNode* q) {
    if(root == NULL)
        return NULL;
    if(root == p || root == q)
        return root;
    struct TreeNode* left_LCA = lowestCommonAncestor(root->left, p, q);
    struct TreeNode* right_LCA = lowestCommonAncestor(root->right, p, q);
    if(left_LCA && right_LCA)
        return root;
    else
        return (left_LCA != NULL)?left_LCA:right_LCA;
}