Add solution #1325

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,230 LeetCode solutions in JavaScript
+# 1,231 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1004,6 +1004,7 @@
 1320|[Minimum Distance to Type a Word Using Two Fingers](./solutions/1320-minimum-distance-to-type-a-word-using-two-fingers.js)|Hard|
 1323|[Maximum 69 Number](./solutions/1323-maximum-69-number.js)|Easy|
 1324|[Print Words Vertically](./solutions/1324-print-words-vertically.js)|Medium|
+1325|[Delete Leaves With a Given Value](./solutions/1325-delete-leaves-with-a-given-value.js)|Medium|
 1331|[Rank Transform of an Array](./solutions/1331-rank-transform-of-an-array.js)|Easy|
 1332|[Remove Palindromic Subsequences](./solutions/1332-remove-palindromic-subsequences.js)|Easy|
 1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](./solutions/1333-filter-restaurants-by-vegan-friendly-price-and-distance.js)|Medium|

solutions/1325-delete-leaves-with-a-given-value.js

@@ -0,0 +1,41 @@
+/**
+ * 1325. Delete Leaves With a Given Value
+ * https://leetcode.com/problems/delete-leaves-with-a-given-value/
+ * Difficulty: Medium
+ *
+ * Given a binary tree root and an integer target, delete all the leaf nodes with value target.
+ *
+ * Note that once you delete a leaf node with value target, if its parent node becomes a leaf
+ * node and has the value target, it should also be deleted (you need to continue doing that
+ * until you cannot).
+ */
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {number} target
+ * @return {TreeNode}
+ */
+var removeLeafNodes = function(root, target) {
+  return pruneLeaves(root);
+
+  function pruneLeaves(node) {
+    if (!node) return null;
+
+    node.left = pruneLeaves(node.left);
+    node.right = pruneLeaves(node.right);
+
+    if (!node.left && !node.right && node.val === target) {
+      return null;
+    }
+
+    return node;
+  }
+};