解题思路:
(1)从上到下,遍历删除,因此采用后序遍历
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* removeLeafNodes(TreeNode* root, int target) {
if(!root) return NULL;
root->left=removeLeafNodes(root->left, target);
root->right=removeLeafNodes(root->right, target);
if(root->val!=target) return root;
else if(!root->left && !root->right) root=NULL;
return root;
}
};