@@ -0,0 +1,2102 @@
+package com.fishercoder.solutions;%0A%0Aimport com.fishercoder.common.classes.TreeNode;%0A%0A/**%0A * 1325. Delete Leaves With a Given Value%0A *%0A * Given a binary tree root and an integer target, delete all the leaf nodes with value target.%0A * Note that once you delete a leaf node with value target, if it's parent node becomes a leaf node and has the value target,%0A * it should also be deleted (you need to continue doing that until you can't).%0A *%0A * Example 1:%0A *        1             1              1%0A *       / %5C           / %5C              %5C%0A *      2  3    -%3E    2  3    -%3E         3%0A *     /  / %5C             %5C               %5C%0A *    2   2 4             4               4%0A *%0A * Input: root = %5B1,2,3,2,null,2,4%5D, target = 2%0A * Output: %5B1,null,3,null,4%5D%0A * Explanation: Leaf nodes in green with value (target = 2) are removed (Picture in left).%0A * After removing, new nodes become leaf nodes with value (target = 2) (Picture in center).%0A *%0A * Example 2:%0A *          1          1%0A *         / %5C        /%0A *        3  3  -%3E   3%0A *       / %5C          %5C%0A *      3  2          2%0A *%0A * Input: root = %5B1,3,3,3,2%5D, target = 3%0A * Output: %5B1,3,null,null,2%5D%0A *%0A * Example 3:%0A *         1              1            1          1%0A *        /              /            /%0A *       2              2            2%0A *      /       -%3E     /      -%3E             -%3E%0A *     2              2%0A *    /%0A *   2%0A *%0A * Input: root = %5B1,2,null,2,null,2%5D, target = 2%0A * Output: %5B1%5D%0A * Explanation: Leaf nodes in green with value (target = 2) are removed at each step.%0A *%0A * Example 4:%0A *          1%0A *         / %5C    -%3E%0A *        1  1%0A * Input: root = %5B1,1,1%5D, target = 1%0A * Output: %5B%5D%0A *%0A * Example 5:%0A *         1             1%0A *        / %5C    -%3E     / %5C%0A *       2  3          2  3%0A *%0A * Input: root = %5B1,2,3%5D, target = 1%0A * Output: %5B1,2,3%5D%0A *%0A * Constraints:%0A * 1 %3C= target %3C= 1000%0A * Each tree has at most 3000 nodes.%0A * Each node's value is between %5B1, 1000%5D.%0A * */%0Apublic class _1325 %7B%0A    public static class Solution1 %7B%0A        public TreeNode removeLeafNodes(TreeNode root, int target) %7B%0A            return null;%0A        %7D%0A    %7D%0A%7D%0A

add skeleton for 1325