1325. Delete Leaves With a Given Value

/**
 * 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) {}
 * };
 */
class Solution {
public:
    TreeNode* removeLeafNodes(TreeNode* root, int t) {
        if(root->right)root->right = removeLeafNodes(root->right, t);
        if(root->left)root->left = removeLeafNodes(root->left, t);
        if(!root->left && !root->right && root->val == t) return NULL;
        return root;
    }
};