1325. Delete Leaves With a Given Value

Given a binary tree `root` and an integer `target`, delete all the leaf nodes with value `target`.

Note that once you delete a leaf node with value `target`, if its parent node becomes a leaf node and has the value `target`, it should also be deleted (you need to continue doing that until you cannot).

Example 1:

``````Input: root = [1,2,3,2,null,2,4], target = 2
Output: [1,null,3,null,4]
Explanation: Leaf nodes in green with value (target = 2) are removed (Picture in left).
After removing, new nodes become leaf nodes with value (target = 2) (Picture in center).
``````

Example 2:

``````Input: root = [1,3,3,3,2], target = 3
Output: [1,3,null,null,2]
``````

Example 3:

``````Input: root = [1,2,null,2,null,2], target = 2
Output: [1]
Explanation: Leaf nodes in green with value (target = 2) are removed at each step.
``````

Constraints:

• The number of nodes in the tree is in the range `[1, 3000]`.
• `1 <= Node.val, target <= 1000`

``````class Solution {
public:
TreeNode* removeLeafNodes(TreeNode* root, int target) {
if (!root) return nullptr;
root->left = removeLeafNodes(root->left, target);
root->right = removeLeafNodes(root->right, target);
return (!root->left && !root->right && root->val == target) ? nullptr : root;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1325

https://leetcode.com/problems/delete-leaves-with-a-given-value/

https://leetcode.com/problems/delete-leaves-with-a-given-value/solutions/484264/java-c-python-recursion-solution/

LeetCode All in One 题目讲解汇总(持续更新中…)

（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，快快加入吧～）

|

Venmo 打赏

—|—

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation