Runtime: 14 ms (Top 14.50%) | Memory: 44.9 MB (Top 83.15%)

Author: AnasImloul

scripts/algorithms/M/Most Frequent Subtree Sum/Most Frequent Subtree Sum.java

@@ -1,14 +1,15 @@
+// Runtime: 14 ms (Top 14.50%) | Memory: 44.9 MB (Top 83.15%)
 class Solution {
     public int[] findFrequentTreeSum(TreeNode root) {
-        
+
         HashMap<Integer,Integer> map=new HashMap<>();
         int sum=sum(root,map);
         int max=0;
         int count=0;
         for(Integer key:map.keySet()){
             max=Math.max(max,map.get(key));
         }
-       
+
         for(Integer key:map.keySet()){
             if(max==map.get(key)){
                 count++;
@@ -21,11 +22,9 @@ public int[] findFrequentTreeSum(TreeNode root) {
                 ans[counter++]=key;
             }
         }
-        
-        
-        
+
         return ans;
-        
+
     }
     public int sum(TreeNode root,HashMap<Integer,Integer> map){
         if(root==null)return 0;
@@ -34,4 +33,4 @@ public int sum(TreeNode root,HashMap<Integer,Integer> map){
         map.put(lh+rh+root.val,map.getOrDefault(lh+rh+root.val,0)+1);
         return lh+rh+root.val;
     }
-}
+}