Runtime: 179 ms (Top 13.99%) | Memory: 158.1 MB (Top 58.04%)

Author: AnasImloul

scripts/algorithms/M/Merge BSTs to Create Single BST/Merge BSTs to Create Single BST.java

@@ -1,3 +1,4 @@
+// Runtime: 179 ms (Top 13.99%) | Memory: 158.1 MB (Top 58.04%)
 
 class Solution {
     public TreeNode canMerge(List<TreeNode> trees) {
@@ -6,15 +7,14 @@ public TreeNode canMerge(List<TreeNode> trees) {
         for(TreeNode t : trees){
             map.put(t.val, t);
         }
-        
+
         // Merge trees
         for(TreeNode t : trees){
             if(map.containsKey(t.val)){
                 merger(t, map);
             }
         }
 
-        
         //After merging we should have only one tree left else return null
         if(map.size() != 1) return null;
         else {
@@ -26,12 +26,11 @@ public TreeNode canMerge(List<TreeNode> trees) {
                 } else return null;
             }
         }
-        
+
       return null;
-        
-        
+
     }
-    
+
     void merger(TreeNode t, HashMap<Integer, TreeNode> map){
         map.remove(t.val); // Remove current tree to prevent cyclical merging For. 2->3(Right) and 3->2(Left)
         //Merge on left
@@ -41,9 +40,9 @@ void merger(TreeNode t, HashMap<Integer, TreeNode> map){
             t.left = map.get(t.left.val);
             map.remove(t.left.val);
         }
-        
+
         // Merge on right
-        if(t.right!=null &&  map.containsKey(t.right.val)  ){
+        if(t.right!=null && map.containsKey(t.right.val) ){
             // Before merging child node, merge the grandchild nodes
             merger(map.get(t.right.val), map);
             t.right = map.get(t.right.val);
@@ -52,15 +51,15 @@ void merger(TreeNode t, HashMap<Integer, TreeNode> map){
         // Add tree back to map once right and left merge is complete
         map.put(t.val, t);
     }
-    
+
     // Validate BST
     public boolean isValidBST(TreeNode root) {
         return helper(root, Long.MIN_VALUE, Long.MAX_VALUE);
     }
-    
+
     public boolean helper(TreeNode root, long min, long max){
         if(root == null) return true;
         if(root.val <= min || root.val >= max) return false;
         return helper(root.left, min, root.val) && helper(root.right, root.val, max);
     }
-}
+}