1325_Delete_Leaves_With_a_Given_Value.cpp

/**
 *  * Definition for a binary tree node.
 *   * struct TreeNode {
 *    *     int val;
 *     *     TreeNode *left;
 *      *     TreeNode *right;
 *       *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 *        * };
 *         */
class Solution {
	public:
		    TreeNode* removeLeafNodes(TreeNode* root, int target) {
			            if (root->left != NULL)
					                root->left = removeLeafNodes(root->left, target);
				            if (root->right != NULL)
						                root->right = removeLeafNodes(root->right, target);
					            if (root->left == NULL && root->right == NULL && root->val == target)
							                return NULL;
						            return root;
							        }
};