LeetCode 1325. 删除给定值的叶子节点
原题链接
中等
作者:
大明湖的鱼
,
2021-01-31 23:37:32
,
所有人可见
,
阅读 308
/**
* 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 == nullptr) return nullptr;
root->left = removeLeafNodes(root->left,target);
root->right = removeLeafNodes(root->right,target);
if(root->val == target && root->left == nullptr && root->right == nullptr){
return nullptr;
}
return root;
}
};