JAVA || TREEMAP || Sorting ||EASY
\nclass Solution {\n    public String sortVowels(String s) {\n        TreeMap<Character,Integer> hm = new TreeMap();\n        char[] car = new char[s.length()];
```\nclass Solution {\n    public String sortVowels(String s) {\n        TreeMap<Character,Integer> hm = new TreeMap();\n        char[] car = new char[s.length()];\n        int len = s.length();\n        int i = 0;\n        for(char c: s.toCharArray()){\n            if( c== \'a\' || c == \'e\' || c == \'i\' || c== \'o\' || c == \'u\' || c== \'A\' || c == \'E\' || c == \'I\' || c== \'O\' || c == \'U\'   ){\n                hm.put(c, hm.getOrDefault(c,0)+1);\n                car[i] = \' \';\n            }else\n                car[i] = c;\n            i++;\n        }\n        System.out.println(hm);\n        \n        String ans = "";\n        for(char c: car){\n            if(c == \' \'){\n                char cc = (char)hm.firstKey();\n                hm.put(cc, hm.get(cc) -1);\n                if(hm.get(cc) == 0)\n                    hm.remove(cc);\n                ans+=cc;\n            }else\n                ans+=c;\n        }\n        return ans;\n        \n    }\n}\n```
['Array', 'Tree', 'Sorting', 'Java']