Improved task 2415.

README.md

@@ -1857,7 +1857,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.16'
 | 2419 |[Longest Subarray With Maximum Bitwise AND](src/main/java/g2401_2500/s2419_longest_subarray_with_maximum_bitwise_and/Solution.java)| Medium | Array, Bit_Manipulation, Brainteaser | 4 | 83.94
 | 2418 |[Sort the People](src/main/java/g2401_2500/s2418_sort_the_people/Solution.java)| Easy | Array, String, Hash_Table, Sorting | 3 | 99.81
 | 2416 |[Sum of Prefix Scores of Strings](src/main/java/g2401_2500/s2416_sum_of_prefix_scores_of_strings/Solution.java)| Hard | Array, String, Counting, Trie | 179 | 94.98
-| 2415 |[Reverse Odd Levels of Binary Tree](src/main/java/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/Solution.java)| Medium | Tree, Binary_Tree, Depth_First_Search, Breadth_First_Search | 12 | 64.14
+| 2415 |[Reverse Odd Levels of Binary Tree](src/main/java/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 12 | 64.14
 | 2414 |[Length of the Longest Alphabetical Continuous Substring](src/main/java/g2401_2500/s2414_length_of_the_longest_alphabetical_continuous_substring/Solution.java)| Medium | String | 19 | 74.13
 | 2413 |[Smallest Even Multiple](src/main/java/g2401_2500/s2413_smallest_even_multiple/Solution.java)| Easy | Math, Number_Theory | 0 | 100.00
 | 2412 |[Minimum Money Required Before Transactions](src/main/java/g2401_2500/s2412_minimum_money_required_before_transactions/Solution.java)| Hard | Array, Sorting, Greedy | 4 | 97.57

src/main/java/g2401_2500/s2415_reverse_odd_levels_of_binary_tree/Solution.java

@@ -1,6 +1,6 @@
 package g2401_2500.s2415_reverse_odd_levels_of_binary_tree;
 
-// #Medium #Tree #Binary_Tree #Depth_First_Search #Breadth_First_Search
+// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
 // #2022_11_15_Time_12_ms_(64.14%)_Space_49.7_MB_(87.20%)
 
 import com_github_leetcode.TreeNode;