2025-01-23 v. 8.2.5.6: updated TreeNode initialization for tests

fartem · fartem · commit d2bd49e5410d · 2025-01-23T20:24:53.000+03:00
diff --git a/leetcode-ruby.gemspec b/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 = '8.2.5.5'
+  s.version = '8.2.5.6'
   s.license = 'MIT'
   s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
   s.executable = 'leetcode-ruby'
diff --git a/test/easy/test_1022_sum_of_root_to_leaf_binary_numbers.rb b/test/easy/test_1022_sum_of_root_to_leaf_binary_numbers.rb
@@ -10,18 +10,8 @@ def test_default_one
     assert_equal(
       22,
       sum_root_to_leaf(
-        ::TreeNode.new(
-          1,
-          ::TreeNode.new(
-            0,
-            ::TreeNode.new(0),
-            ::TreeNode.new(1)
-          ),
-          ::TreeNode.new(
-            1,
-            ::TreeNode.new(0),
-            ::TreeNode.new(1)
-          )
+        ::TreeNode.build_tree(
+          [1, 0, 1, 0, 1, 0, 1]
         )
       )
     )
@@ -31,7 +21,9 @@ def test_default_two
     assert_equal(
       0,
       sum_root_to_leaf(
-        ::TreeNode.new(0)
+        ::TreeNode.build_tree(
+          [0]
+        )
       )
     )
   end
diff --git a/test/easy/test_2236_root_equals_sum_of_children.rb b/test/easy/test_2236_root_equals_sum_of_children.rb
@@ -9,10 +9,8 @@ class RootEqualsSumOfChildrenTest < ::Minitest::Test
   def test_default_one
     assert(
       check_tree(
-        ::TreeNode.new(
-          10,
-          ::TreeNode.new(4),
-          ::TreeNode.new(6)
+        ::TreeNode.build_tree(
+          [10, 4, 6]
         )
       )
     )
@@ -21,10 +19,8 @@ def test_default_one
   def test_default_two
     assert(
       !check_tree(
-        ::TreeNode.new(
-          5,
-          ::TreeNode.new(3),
-          ::TreeNode.new(1)
+        ::TreeNode.build_tree(
+          [5, 3, 1]
         )
       )
     )
diff --git a/test/easy/test_2331_evaluate_boolean_binary_tree.rb b/test/easy/test_2331_evaluate_boolean_binary_tree.rb
@@ -9,39 +9,28 @@ class EvaluateBooleanBinaryTreeTest < ::Minitest::Test
   def test_default_one
     assert(
       evaluate_tree(
-        ::TreeNode.new(
-          2,
-          ::TreeNode.new(1),
-          ::TreeNode.new(
-            3,
-            ::TreeNode.new(0),
-            ::TreeNode.new(1)
-          )
+        ::TreeNode.build_tree(
+          [2, 1, 3, nil, nil, 0, 1]
         )
       )
     )
-    assert(
-      !evaluate_tree(
-        ::TreeNode.new(0)
-      )
-    )
   end
 
   def test_default_two
     assert(
       !evaluate_tree(
-        ::TreeNode.new(0)
+        ::TreeNode.build_tree(
+          [0]
+        )
       )
     )
   end
 
   def test_additional_one
     assert(
       !evaluate_tree(
-        ::TreeNode.new(
-          3,
-          ::TreeNode.new(0),
-          ::TreeNode.new(1)
+        ::TreeNode.build_tree(
+          [3, 0, 1]
         )
       )
     )
diff --git a/test/easy/test_617_merge_two_binary_trees.rb b/test/easy/test_617_merge_two_binary_trees.rb
@@ -9,41 +9,15 @@ class MergeTwoBinaryTreesTest < ::Minitest::Test
   def test_default_one
     assert(
       ::TreeNode.are_equals(
-        ::TreeNode.new(
-          3,
-          ::TreeNode.new(
-            4,
-            ::TreeNode.new(5),
-            ::TreeNode.new(4)
-          ),
-          ::TreeNode.new(
-            5,
-            nil,
-            ::TreeNode.new(7)
-          )
+        ::TreeNode.build_tree(
+          [3, 4, 5, 5, 4, nil, 7]
         ),
         merge_trees(
-          ::TreeNode.new(
-            1,
-            ::TreeNode.new(
-              3,
-              ::TreeNode.new(5),
-              nil
-            ),
-            ::TreeNode.new(2)
+          ::TreeNode.build_tree(
+            [1, 3, 2, 5]
           ),
-          ::TreeNode.new(
-            2,
-            ::TreeNode.new(
-              1,
-              nil,
-              ::TreeNode.new(4)
-            ),
-            ::TreeNode.new(
-              3,
-              nil,
-              ::TreeNode.new(7)
-            )
+          ::TreeNode.build_tree(
+            [2, 1, 3, nil, 4, nil, 7]
           )
         )
       )
@@ -53,17 +27,15 @@ def test_default_one
   def test_default_two
     assert(
       ::TreeNode.are_equals(
-        ::TreeNode.new(
-          2,
-          ::TreeNode.new(2),
-          nil
+        ::TreeNode.build_tree(
+          [2, 2]
         ),
         merge_trees(
-          ::TreeNode.new(1),
-          ::TreeNode.new(
-            1,
-            ::TreeNode.new(2),
-            nil
+          ::TreeNode.build_tree(
+            [1]
+          ),
+          ::TreeNode.build_tree(
+            [1, 2]
           )
         )
       )
diff --git a/test/easy/test_637_average_of_levels_in_binary_tree.rb b/test/easy/test_637_average_of_levels_in_binary_tree.rb
@@ -8,33 +8,29 @@
 class AverageOfLevelsInBinaryTreeTest < ::Minitest::Test
   def test_default_one
     assert_equal(
-      [3.00000, 14.50000, 11.00000],
+      [
+        3.00000,
+        14.50000,
+        11.00000
+      ],
       average_of_levels(
-        ::TreeNode.new(
-          3,
-          ::TreeNode.new(9),
-          ::TreeNode.new(
-            20,
-            ::TreeNode.new(15),
-            ::TreeNode.new(7)
-          )
+        ::TreeNode.build_tree(
+          [3, 9, 20, nil, nil, 15, 7]
         )
       )
     )
   end
 
   def test_default_two
     assert_equal(
-      [3.00000, 14.50000, 11.00000],
+      [
+        3.00000,
+        14.50000,
+        11.00000
+      ],
       average_of_levels(
-        ::TreeNode.new(
-          3,
-          ::TreeNode.new(
-            20,
-            ::TreeNode.new(15),
-            ::TreeNode.new(7)
-          ),
-          ::TreeNode.new(9)
+        ::TreeNode.build_tree(
+          [3, 9, 20, 15, 7]
         )
       )
     )
diff --git a/test/easy/test_653_two_sum_iv_input_is_a_bst.rb b/test/easy/test_653_two_sum_iv_input_is_a_bst.rb
@@ -9,18 +9,8 @@ class TwoSumIVInputIsABSTTest < ::Minitest::Test
   def test_default_one
     assert(
       find_target(
-        ::TreeNode.new(
-          5,
-          ::TreeNode.new(
-            3,
-            ::TreeNode.new(2),
-            ::TreeNode.new(4)
-          ),
-          ::TreeNode.new(
-            6,
-            nil,
-            ::TreeNode.new(7)
-          )
+        ::TreeNode.build_tree(
+          [5, 3, 6, 2, 4, nil, 7]
         ),
         9
       )
@@ -30,18 +20,8 @@ def test_default_one
   def test_default_two
     assert(
       !find_target(
-        ::TreeNode.new(
-          5,
-          ::TreeNode.new(
-            3,
-            ::TreeNode.new(2),
-            ::TreeNode.new(4)
-          ),
-          ::TreeNode.new(
-            6,
-            nil,
-            ::TreeNode.new(7)
-          )
+        ::TreeNode.build_tree(
+          [5, 3, 6, 2, 4, nil, 7]
         ),
         28
       )
diff --git a/test/easy/test_671_second_minimum_node_in_a_binary_tree.rb b/test/easy/test_671_second_minimum_node_in_a_binary_tree.rb
@@ -10,14 +10,8 @@ def test_default_one
     assert_equal(
       5,
       find_second_minimum_value(
-        ::TreeNode.new(
-          2,
-          ::TreeNode.new(2),
-          ::TreeNode.new(
-            5,
-            ::TreeNode.new(5),
-            ::TreeNode.new(7)
-          )
+        ::TreeNode.build_tree(
+          [2, 2, 5, nil, nil, 5, 7]
         )
       )
     )
@@ -27,10 +21,8 @@ def test_default_two
     assert_equal(
       -1,
       find_second_minimum_value(
-        ::TreeNode.new(
-          2,
-          ::TreeNode.new(2),
-          ::TreeNode.new(2)
+        ::TreeNode.build_tree(
+          [2, 2, 2]
         )
       )
     )
diff --git a/test/easy/test_700_search_in_a_binary_search_tree.rb b/test/easy/test_700_search_in_a_binary_search_tree.rb
@@ -9,20 +9,12 @@ class SearchInABinarySearchTreeTest < ::Minitest::Test
   def test_default_one
     assert(
       ::TreeNode.are_equals(
-        ::TreeNode.new(
-          2,
-          ::TreeNode.new(1),
-          ::TreeNode.new(3)
+        ::TreeNode.build_tree(
+          [2, 1, 3]
         ),
         search_bst(
-          ::TreeNode.new(
-            4,
-            ::TreeNode.new(
-              2,
-              ::TreeNode.new(1),
-              ::TreeNode.new(3)
-            ),
-            ::TreeNode.new(7)
+          ::TreeNode.build_tree(
+            [4, 2, 7, 1, 3]
           ),
           2
         )
@@ -33,14 +25,8 @@ def test_default_one
   def test_default_two
     assert_nil(
       search_bst(
-        ::TreeNode.new(
-          4,
-          ::TreeNode.new(
-            2,
-            ::TreeNode.new(1),
-            ::TreeNode.new(3)
-          ),
-          ::TreeNode.new(7)
+        ::TreeNode.build_tree(
+          [4, 2, 7, 1, 3]
         ),
         5
       )
diff --git a/test/easy/test_783_minimum_distance_between_bst_nodes.rb b/test/easy/test_783_minimum_distance_between_bst_nodes.rb
@@ -10,14 +10,8 @@ def test_default_one
     assert_equal(
       1,
       min_diff_in_bst(
-        ::TreeNode.new(
-          4,
-          ::TreeNode.new(
-            2,
-            ::TreeNode.new(1),
-            ::TreeNode.new(3)
-          ),
-          ::TreeNode.new(6)
+        ::TreeNode.build_tree(
+          [4, 2, 6, 1, 3]
         )
       )
     )
@@ -27,14 +21,8 @@ def test_default_two
     assert_equal(
       1,
       min_diff_in_bst(
-        ::TreeNode.new(
-          1,
-          ::TreeNode.new(0),
-          ::TreeNode.new(
-            48,
-            ::TreeNode.new(12),
-            ::TreeNode.new(49)
-          )
+        ::TreeNode.build_tree(
+          [1, 0, 48, nil, nil, 12, 49]
         )
       )
     )
diff --git a/test/easy/test_872_leaf_similar_trees.rb b/test/easy/test_872_leaf_similar_trees.rb
diff --git a/test/easy/test_897_increasing_order_search_tree.rb b/test/easy/test_897_increasing_order_search_tree.rb
diff --git a/test/easy/test_938_range_sum_of_bst.rb b/test/easy/test_938_range_sum_of_bst.rb
diff --git a/test/easy/test_965_univalued_binary_tree.rb b/test/easy/test_965_univalued_binary_tree.rb
diff --git a/test/easy/test_993_cousins_in_binary_tree.rb b/test/easy/test_993_cousins_in_binary_tree.rb

Original file line number	Diff line number	Diff line change
`@@ -9,10 +9,8 @@ class RootEqualsSumOfChildrenTest < ::Minitest::Test`
`9`	`9`	`def test_default_one`
`10`	`10`	`assert(`
`11`	`11`	`check_tree(`
`12`		`- ::TreeNode.new(`
`13`		`- 10,`
`14`		`- ::TreeNode.new(4),`
`15`		`- ::TreeNode.new(6)`
	`12`	`+ ::TreeNode.build_tree(`
	`13`	`+ [10, 4, 6]`
`16`	`14`	`)`
`17`	`15`	`)`
`18`	`16`	`)`
`@@ -21,10 +19,8 @@ def test_default_one`
`21`	`19`	`def test_default_two`
`22`	`20`	`assert(`
`23`	`21`	`!check_tree(`
`24`		`- ::TreeNode.new(`
`25`		`- 5,`
`26`		`- ::TreeNode.new(3),`
`27`		`- ::TreeNode.new(1)`
	`22`	`+ ::TreeNode.build_tree(`
	`23`	`+ [5, 3, 1]`
`28`	`24`	`)`
`29`	`25`	`)`
`30`	`26`	`)`
Original file line number	Diff line number	Diff line change
`@@ -10,14 +10,8 @@ def test_default_one`
`10`	`10`	`assert_equal(`
`11`	`11`	`5,`
`12`	`12`	`find_second_minimum_value(`
`13`		`- ::TreeNode.new(`
`14`		`- 2,`
`15`		`- ::TreeNode.new(2),`
`16`		`- ::TreeNode.new(`
`17`		`- 5,`
`18`		`- ::TreeNode.new(5),`
`19`		`- ::TreeNode.new(7)`
`20`		`- )`
	`13`	`+ ::TreeNode.build_tree(`
	`14`	`+ [2, 2, 5, nil, nil, 5, 7]`
`21`	`15`	`)`
`22`	`16`	`)`
`23`	`17`	`)`
`@@ -27,10 +21,8 @@ def test_default_two`
`27`	`21`	`assert_equal(`
`28`	`22`	`-1,`
`29`	`23`	`find_second_minimum_value(`
`30`		`- ::TreeNode.new(`
`31`		`- 2,`
`32`		`- ::TreeNode.new(2),`
`33`		`- ::TreeNode.new(2)`
	`24`	`+ ::TreeNode.build_tree(`
	`25`	`+ [2, 2, 2]`
`34`	`26`	`)`
`35`	`27`	`)`
`36`	`28`	`)`