DSA/C++/LeetCode/0814.cpp at main · spycedcoffee/DSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// Solution 1 :-
class Solution {
public:
  TreeNode *pruneTree(TreeNode *root) {
    if (!root)
      return nullptr;
    root->left = pruneTree(root->left);
    root->right = pruneTree(root->right);
    if (root->val == 1 or root->left or root->right)
      return root;
    return nullptr;
  }
};

// Solution 2 :-
class Solution {
public:
    TreeNode* pruneTree(TreeNode* root) {
        if (!root)
            return NULL;

        root -> left = pruneTree(root -> left);
        root -> right = pruneTree(root -> right);

        if (!root -> left && !root -> right && root -> val == 0)
            return NULL;

        return root;
    }
};