cpp最近公共祖树

自己想的思路，比较简单但写起来挺琐碎

    TreeNode *r;
    vector<bool> search(TreeNode* node, TreeNode* p, TreeNode *q){
        vector<bool> result;
        if(node == nullptr){
            result.push_back(0);
            result.push_back(0);
            return result;
        }
        vector<bool> q1 = search(node->left, p, q);
        if(q1[0] && q1[1])
            return q1;
        vector<bool> q2 = search(node->right, p, q);
        if(q2[0] && q2[1])
            return q2;
        if(node == p)
            result.push_back(1);
        else
            result.push_back(0);
        if(node == q)
            result.push_back(1);
        else
            result.push_back(0);
        result[0] = result[0] || q1[0] || q2[0];
        result[1] = result[1] || q1[1] || q2[1];
        if(result[0] && result[1]){
            r = node;
        }
        return result;
    }
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        search(root, p, q);
        return this->r;
    }