AcWing 88. 树中两个结点的最低公共祖先（C++）- 二叉树、递归、最近公共祖先

题目链接：https://www.acwing.com/problem/content/84/
题目如下：

/**
 * 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||root==p||root==q) return root;
        
        //二叉树求公共祖先，目标，从下到上，回溯，即后序遍历
        TreeNode* left=lowestCommonAncestor(root->left,p,q);
        TreeNode* right=lowestCommonAncestor(root->right,p,q);
        
        //这里记住卡哥的图
        if(!left) return right;
        else if(!right) return left;
        else if(!left&&!right) return nullptr;
        else return root;
        
        return root;
    }
};