refactor 1214

fishercoder1534 · fishercoder1534 · commit edad6e51610d · 2020-08-12T11:59:35.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_1214.java b/src/main/java/com/fishercoder/solutions/_1214.java
@@ -5,35 +5,6 @@
 import java.util.ArrayList;
 import java.util.List;
 
-/**
- * 1214. Two Sum BSTs
- *
- * Given two binary search trees,
- * return True if and only if there is a node in the first tree and a node in the second tree whose values sum up to a given integer target.
- *
- * Example 1:
- *        2             1
- *       / \           / \
- *      1  4          0  3
- *
- * Input: root1 = [2,1,4], root2 = [1,0,3], target = 5
- * Output: true
- * Explanation: 2 and 3 sum up to 5.
- *
- * Example 2:
- *         0                   5
- *        / \                 / \
- *      -10  10              1   7
- *                          / \
- *                         0  2
- *
- * Input: root1 = [0,-10,10], root2 = [5,1,7,0,2], target = 18
- * Output: false
- *
- * Constraints:
- * Each tree has at most 5000 nodes.
- * -10^9 <= target, node.val <= 10^9
- * */
 public class _1214 {
     public static class Solution1 {
         public boolean twoSumBSTs(TreeNode root1, TreeNode root2, int target) {
