1
TreeNode* removeLeafNodes(TreeNode* root, int target) {
2
  if (root == nullptr) return nullptr;
3
  root->left = removeLeafNodes(root->left, target);
4
  root->right = removeLeafNodes(root->right, target);
5
  if (!root->left && !root->right && target == root->val)
6
    return nullptr;
7
  else
8
    return root;
9
}