LeetCode-Binary Tree Pruning

Description：
We are given the head node root of a binary tree, where additionally every node’s value is either a 0 or a 1.

Return the same tree where every subtree (of the given tree) not containing a 1 has been removed.

(Recall that the subtree of a node X is X, plus every node that is a descendant of X.)

Example 1:

Input: [1,null,0,0,1]
Output: [1,null,0,null,1]
 
Explanation: 
Only the red nodes satisfy the property "every subtree not containing a 1".
The diagram on the right represents the answer.

Example 2:

Input: [1,0,1,0,0,0,1]
Output: [1,null,1,null,1]

Example 3:

Input: [1,1,0,1,1,0,1,0]
Output: [1,1,0,1,1,null,1]

Note:

• The binary tree will have at most 100 nodes.
• The value of each node will only be 0 or 1.

题意：要求对一颗二叉树进行剪枝操作，删去不包含节点值为1的所有子树；

解法：遍历二叉树（后序遍历），从叶子节点开始判断，如果其节点值为0，则删去此节点；这里需要说明的是为什么要使用后序遍历，当节点root的左右子树均不包含节点值为1的节点时，我们需要同时删除左右子树，此时，若root的值也为0，那么此节点也需要删除，如果使用的是非后序遍历，那么这个节点并不会被删除；

Java

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode pruneTree(TreeNode root) {
        if (root == null) {
            return root;
        }
        root.left = pruneTree(root.left);
        root.right = pruneTree(root.right);
        if (root.left == null && root.right == null) {
            return root.val == 0 ? null : root;
        }
        
        return root;
    }
}