JAVA_Find Mode in Binary Search Tree_LeetCode 501

JAVA_Find Mode in Binary Search Tree_LeetCode 501 풀이 class Solution { Map<Integer,Integer> map = new HashMap<>(); public int[] findMode(TreeNode root) { dfs(root); int max = 0; List<Integer> k= new ArrayList<>(); for(int i : map.values()) max = Math.max(i,max); for(int key: map.keySet()){ if(map.get(key)==max) k.add(key); } int[] ans = new int[k.size()]; for(int i = 0;i<k.size();i++){ ans[i] = k.get(i); } return ans; } public void dfs(TreeNode root){ if (root==null) return; map.put(root.val,map....

원문링크 : JAVA_Find Mode in Binary Search Tree_LeetCode 501