Leetcode 1325. Delete Leaves With a Given Value
题目链接: Delete Leaves With a Given Value
难度:Medium
题目大意:
将二叉树中值为target的叶子节点去掉,注意去掉叶子节点后父节点可能也会变成叶子节点。
思路:
递归。本题思路与leetcode814基本一样。
代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public TreeNode removeLeafNodes(TreeNode root, int target) {
if(root==null){
return root;
}
root.left=removeLeafNodes(root.left,target);
root.right=removeLeafNodes(root.right,target);
if(root.left==null&&root.right==null&&root.val==target){
return null;
}
return root;
}
}