2025-04-08 v. 9.2.1: added "2415. Reverse Odd Levels of Binary Tree"

Author: fartem

README.md

@@ -755,6 +755,7 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 2326. Spiral Matrix IV                                                              | [Link](https://leetcode.com/problems/spiral-matrix-iv/)                                                              | [Link](./lib/medium/2326_spiral_matrix_iv.rb)                                                              | [Link](./test/medium/test_2326_spiral_matrix_iv.rb)                                                              |
 | 2375. Construct Smallest Number From DI String                                      | [Link](https://leetcode.com/problems/construct-smallest-number-from-di-string/)                                      | [Link](./lib/medium/2375_construct_smallest_number_from_di_string.rb)                                      | [Link](./test/medium/test_2375_construct_smallest_number_from_di_string.rb)                                      |
 | 2390. Removing Stars From a String                                                  | [Link](https://leetcode.com/problems/removing-stars-from-a-string/)                                                  | [Link](./lib/medium/2390_removing_stars_from_a_string.rb)                                                  | [Link](./test/medium/test_2390_removing_stars_from_a_string.rb)                                                  |
+| 2415. Reverse Odd Levels of Binary Tree                                             | [Link](https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/)                                             | [Link](./lib/medium/2415_reverse_odd_levels_of_binary_tree.rb)                                             | [Link](./test/medium/test_2415_reverse_odd_levels_of_binary_tree.rb)                                             |
 | 2425. Bitwise XOR of All Pairings                                                   | [Link](https://leetcode.com/problems/bitwise-xor-of-all-pairings/)                                                   | [Link](./lib/medium/2425_bitwise_xor_of_all_pairings.rb)                                                   | [Link](./test/medium/test_2425_bitwise_xor_of_all_pairings.rb)                                                   |
 | 2429. Minimize XOR                                                                  | [Link](https://leetcode.com/problems/minimize-xor/)                                                                  | [Link](./lib/medium/2429_minimize_xor.rb)                                                                  | [Link](./test/medium/test_2429_minimize_xor.rb)                                                                  |
 | 2657. Find the Prefix Common Array of Two Arrays                                    | [Link](https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/)                                    | [Link](./lib/medium/2657_find_the_prefix_common_array_of_two_arrays.rb)                                    | [Link](./test/medium/test_2657_find_the_prefix_common_array_of_two_arrays.rb)                                    |

leetcode-ruby.gemspec

@@ -5,7 +5,7 @@ require 'English'
 ::Gem::Specification.new do |s|
   s.required_ruby_version = '>= 3.0'
   s.name = 'leetcode-ruby'
-  s.version = '9.2.0'
+  s.version = '9.2.1'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'

lib/medium/2415_reverse_odd_levels_of_binary_tree.rb

@@ -0,0 +1,29 @@
+# frozen_string_literal: true
+
+# https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/
+# @param {TreeNode} root
+# @return {TreeNode}
+def reverse_odd_levels(root)
+  traverse_for_reverse_odd_levels(root.left, root.right, 1)
+
+  root
+end
+
+private
+
+# @param {TreeNode} left
+# @param {TreeNode} right
+# @param {Integer} level
+# @return {Void}
+def traverse_for_reverse_odd_levels(left, right, level)
+  return if !left || !right
+
+  unless level.even?
+    temp = left.val
+    left.val = right.val
+    right.val = temp
+  end
+
+  traverse_for_reverse_odd_levels(left.left, right.right, level + 1)
+  traverse_for_reverse_odd_levels(left.right, right.left, level + 1)
+end

test/medium/test_2415_reverse_odd_levels_of_binary_tree.rb

@@ -0,0 +1,53 @@
+# frozen_string_literal: true
+
+require_relative '../test_helper'
+require_relative '../../lib/common/binary_tree'
+require_relative '../../lib/medium/2415_reverse_odd_levels_of_binary_tree'
+require 'minitest/autorun'
+
+class ReverseOddLevelsOfBinaryTreeTest < ::Minitest::Test
+  def test_default_one
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.build_tree(
+          [2, 5, 3, 8, 13, 21, 34]
+        ),
+        reverse_odd_levels(
+          ::TreeNode.build_tree(
+            [2, 3, 5, 8, 13, 21, 34]
+          )
+        )
+      )
+    )
+  end
+
+  def test_default_two
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.build_tree(
+          [7, 11, 13]
+        ),
+        reverse_odd_levels(
+          ::TreeNode.build_tree(
+            [7, 13, 11]
+          )
+        )
+      )
+    )
+  end
+
+  def test_default_three
+    assert(
+      ::TreeNode.are_equals(
+        ::TreeNode.build_tree(
+          [0, 2, 1, 0, 0, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1]
+        ),
+        reverse_odd_levels(
+          ::TreeNode.build_tree(
+            [0, 1, 2, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2]
+          )
+        )
+      )
+    )
+  end
+end