力扣 814.二叉树中的深搜_二叉树剪_C++
class Solution {
public:
TreeNode* pruneTree(TreeNode* root) {
if(!root) return nullptr;
root->left=pruneTree(root->left);
root->right=pruneTree(root->right);
if(!root->left &&!root->right && !root->val)
return nullptr;
return root;
}
};