Leetcode 814. Binary Tree Pruning
题目链接: Binary Tree Pruning
难度:Medium
题目大意:
二叉树的节点要么是0要么是1,将二叉树中只含有0的子树去除掉。
思路:
递归,判断子树是否只含有0,如果是则去除掉。然后对左子树和右子树进行相同操作。
代码
自己写的
/**
* 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 pruneTree(TreeNode root) {
if(root==null||isRemove(root)){
return null;
}
if(isRemove(root.left)){
root.left=null;
}
if(isRemove(root.right)){
root.right=null;
}
pruneTree(root.left);
pruneTree(root.right);
return root;
}
public boolean isRemove(TreeNode root){
if(root==null){
return false;
}
if(root.val==1){
return false;
}
else{
if(root.left==null&&root.right==null){
return true;
}
else if(root.left==null){
return isRemove(root.right);
}
else if(root.right==null){
return isRemove(root.left);
}
else{
return isRemove(root.left)&&isRemove(root.right);
}
}
}
}
高赞回答
/**
* 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 pruneTree(TreeNode root) {
if(root==null){
return root;
}
root.left=pruneTree(root.left);
root.right=pruneTree(root.right);
if(root.val==0&&root.left==null&&root.right==null){
return null;
}
return root;
}
}