refactor 1038

fishercoder1534 · fishercoder1534 · commit 971074300d40 · 2020-08-06T15:26:38.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1038.java b/src/main/java/com/fishercoder/solutions/_1038.java
@@ -2,39 +2,11 @@
 
 import com.fishercoder.common.classes.TreeNode;
 
-/**
- * 1038. Binary Search Tree to Greater Sum Tree
- *
- * Given the root of a binary search tree with distinct values,
- * modify it so that every node has a new value equal to the sum of the values of the original tree that are greater than or equal to node.val.
- * As a reminder, a binary search tree is a tree that satisfies these constraints:
- *
- * The left subtree of a node contains only nodes with keys less than the node's key.
- * The right subtree of a node contains only nodes with keys greater than the node's key.
- * Both the left and right subtrees must also be binary search trees.
- *
- *
- * Example 1:
- *                            4(30)
- *                          /    \
- *                       1(36)   6(21)
- *                     /   \     /    \
- *                 0(36)  2(35) 5(26) 7(15)
- *                          \          \
- *                        3(33)        8(8)
- *
- * Input: [4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
- * Output: [30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]
- *
- *
- * Note:
- *
- * The number of nodes in the tree is between 1 and 100.
- * Each node will have value between 0 and 100.
- * The given tree is a binary search tree.*/
 public class _1038 {
     public static class Solution1 {
-        /**credit: https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/discuss/286725/JavaC%2B%2BPython-Revered-Inorder-Traversal*/
+        /**
+         * credit: https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/discuss/286725/JavaC%2B%2BPython-Revered-Inorder-Traversal
+         */
         int greaterSum = 0;
 
         public TreeNode bstToGst(TreeNode root) {
