814. Binary Tree Pruning
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public TreeNode PostOrder(TreeNode T){
if(T!=null){
T.left = PostOrder(T.left);
T.right = PostOrder(T.right);
if(T.left==null&&T.right==null)
if(T.val==0)
T=null;
}
return T;
}
public TreeNode pruneTree(TreeNode root) {
PostOrder(root);
return root;
}
}
还没有评论,来说两句吧...