236 Lowest Common Ancestor of a Binary Tree 二叉树的最近公共祖先-优快云博客

本文介绍了一种寻找二叉树中两个指定节点最近公共祖先的方法，并提供了Java和C++两种语言的实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

给定一棵二叉树, 找到该树中两个指定节点的最近公共祖先。

详见：https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/description/

Java实现：

/**
 * 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) {
        if(root==null||root==p||root==q){
            return root;
        }
        TreeNode left=lowestCommonAncestor(root.left,p,q);
        TreeNode right=lowestCommonAncestor(root.right,p,q);
        if(left!=null&&right!=null){
            return root;
        }
        return left!=null?left:right;
    }
}

C++实现：

/**
 * 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) {
        if(root==nullptr||root==p||root==q)
        {
            return root;
        }
        TreeNode* left=lowestCommonAncestor(root->left,p,q);
        TreeNode* right=lowestCommonAncestor(root->right,p,q);
        if(left&&right)
        {
            return root;
        }
        return left?left:right;
    }
};

参考：https://www.cnblogs.com/grandyang/p/4641968.html

转载于:https://www.cnblogs.com/xidian2014/p/8759291.html