refactor 1302

fishercoder1534 · fishercoder1534 · commit 5d2d00b79de3 · 2020-09-10T08:13:43.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1302.java b/src/main/java/com/fishercoder/solutions/_1302.java
@@ -5,27 +5,6 @@
 import java.util.LinkedList;
 import java.util.Queue;
 
-/**
- * 1302. Deepest Leaves Sum
- *
- * Given a binary tree, return the sum of values of its deepest leaves.
- *
- * Example 1:
- *                1
- *               / \
- *              2   3
- *             / \   \
- *            4  5   6
- *           /        \
- *          7         8
- *
- * Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8]
- * Output: 15
- *
- * Constraints:
- * The number of nodes in the tree is between 1 and 10^4.
- * The value of nodes is between 1 and 100.
- * */
 public class _1302 {
     public static class Solution1 {
         public int deepestLeavesSum(TreeNode root) {
