剑指 Offer 68 - II. 二叉树的最近公共祖先【力扣】

题意理解

求二叉树的最近公共祖先

问题分析

这题挺难的，好好想想先。

其他

力扣

链接

/**
 * 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) {
        helper(root, p, q);
        return ans;
    }
    TreeNode *ans;
    //是否root子树是否包含
    bool helper(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (!root) return false;
        bool lson = helper(root->left, p, q);
        bool rson = helper(root->right, p, q);
        if ((lson && rson) || ((root->val == p -> val || root->val == q -> val) && (lson || rson))) {
            ans = root;
        }
        return lson || rson || root->val == p -> val || root->val == q -> val;
    }
};