814. Binary Tree Pruning [Medium]

https://leetcode.com/problems/binary-tree-pruning/

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 200 nodes.
• The value of each node will only be 0 or 1.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */

---

算法思路： 

递归修建没有1的子树，这里只要子树没有1，那么连接它的父节点相应的链接置为nullptr。

当然这里没有手动释放被裁掉的节点，有内存泄漏。

class Solution {
public:
    TreeNode* pruneTree(TreeNode* root) {
        return hasOneInSubtree(root) ? root : nullptr; 
    }
private:
    bool hasOneInSubtree(TreeNode* node) {
        if (node == nullptr) return false;
        
        bool leftHasOne = hasOneInSubtree(node->left);
        bool rightHasOne = hasOneInSubtree(node->right);
        
        if (!leftHasOne) node->left = nullptr;
        if (!rightHasOne) node->right = nullptr;
        
        return node->val || leftHasOne || rightHasOne;
    }
};

解决内存泄漏问题

class Solution {
public:
    TreeNode* pruneTree(TreeNode* root) {
        return hasOneInSubtree(root) ? root : nullptr; 
    }
private:
    bool hasOneInSubtree(TreeNode* node) {
        if (node == nullptr) return false;
        
        bool leftHasOne = hasOneInSubtree(node->left);
        bool rightHasOne = hasOneInSubtree(node->right);
        
        if (!leftHasOne) {
            TreeNode* delLeftNode = node->left;
            node->left = nullptr;
            if (delLeftNode != nullptr) {
                delete delLeftNode;
                delLeftNode = nullptr;
            }
        } 
        if (!rightHasOne) {
            TreeNode* delRightNode = node->right;
            node->right = nullptr;
            if (delRightNode != nullptr) {
                delete delRightNode;
                delRightNode = nullptr;
            }
        }
        
        return node->val || leftHasOne || rightHasOne;
    }
};