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(TreeNo