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.
二叉树剪枝,去掉所有值为0的叶子节点。
1 class Solution { 2 public: 3 TreeNode* pruneTree(TreeNode* root) { 4 if (!root) 5 return nullptr; 6 root->left = pruneTree(root->left); 7 root->right = pruneTree(root->right); 8 if (root->val == 0 && !root->left && !root->right) 9 root = nullptr; 10 return root; 11 } 12 };