leetcode算法题--删点成林+

原题链接：https://leetcode.cn/problems/delete-nodes-and-return-forest/
这题有点难度，
对于任意节点，需要将该节点的状态传递给子节点(parentExist)，并且返回给父节点 (return del)

class Solution {
public:
    vector<TreeNode*> res;
    set<int> st;
    vector<TreeNode*> delNodes(TreeNode* root, vector<int>& to_delete) {
        if (root == NULL) return res;
        for (auto x : to_delete) {
            st.insert(x);
        }
        dfs(root, false);
        return res;
    }

    bool dfs(TreeNode* root, bool parentExist) {
        bool del = false;
        if (root == NULL) return del;
        del = st.count(root->val);
        if (dfs(root->left, !del)) {
            root->left = NULL;
        }
        if (dfs(root->right, !del)) {
            root->right = NULL;
        }
        if (!del && !parentExist) {
            res.push_back(root);
        }
        return del;
    }
};