From f32f8f39271086e26aa3cfb8a28f6495fc66f93a Mon Sep 17 00:00:00 2001 From: fartem Date: Thu, 23 Jan 2025 17:36:32 +0300 Subject: [PATCH] 2025-01-23 v. 8.2.5.5: updated TreeNode initialization for tests --- leetcode-ruby.gemspec | 2 +- test/easy/test_100_same_tree.rb | 33 ++++++--------- test/easy/test_101_symmetric_tree.rb | 28 ++----------- .../test_104_maximum_depth_of_binary_tree.rb | 16 ++------ test/easy/test_110_balanced_binary_tree.rb | 24 ++--------- .../test_111_minimum_depth_of_binary_tree.rb | 28 ++----------- test/easy/test_112_path_sum.rb | 27 ++----------- ...test_144_binary_tree_preorder_traversal.rb | 13 +++--- ...est_145_binary_tree_postorder_traversal.rb | 13 +++--- test/easy/test_226_invert_binary_tree.rb | 40 ++++--------------- test/easy/test_257_binary_tree_paths.rb | 14 +++---- test/easy/test_404_sum_of_left_leaves.rb | 24 ++++------- ...est_501_find_mode_in_binary_search_tree.rb | 14 +++---- ..._530_minimum_absolute_difference_in_bst.rb | 20 ++-------- test/easy/test_543_diameter_of_binary_tree.rb | 16 ++------ test/easy/test_563_binary_tree_tilt.rb | 38 +++--------------- test/easy/test_572_subtree_of_another_tree.rb | 36 ++++------------- .../test_94_binary_tree_inorder_traversal.rb | 13 +++--- 18 files changed, 95 insertions(+), 304 deletions(-) diff --git a/leetcode-ruby.gemspec b/leetcode-ruby.gemspec index 02685f43..ae672627 100644 --- 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.4' + s.version = '8.2.5.5' s.license = 'MIT' s.files = ::Dir['lib/**/*.rb'] + %w[README.md] s.executable = 'leetcode-ruby' diff --git a/test/easy/test_100_same_tree.rb b/test/easy/test_100_same_tree.rb index 877c253e..bf648ca6 100644 --- a/test/easy/test_100_same_tree.rb +++ b/test/easy/test_100_same_tree.rb @@ -9,15 +9,11 @@ class SameTreeTest < ::Minitest::Test def test_default_one assert( is_same_tree( - ::TreeNode.new( - 1, - ::TreeNode.new(2), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [1, 2, 3] ), - ::TreeNode.new( - 1, - ::TreeNode.new(2), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [1, 2, 3] ) ) ) @@ -26,12 +22,11 @@ def test_default_one def test_default_two assert( !is_same_tree( - ::TreeNode.new( - ::TreeNode.new(2) + ::TreeNode.build_tree( + [1, 2] ), - ::TreeNode.new( - nil, - ::TreeNode.new(2) + ::TreeNode.build_tree( + [1, nil, 2] ) ) ) @@ -40,15 +35,11 @@ def test_default_two def test_default_three assert( !is_same_tree( - ::TreeNode.new( - 1, - ::TreeNode.new(2), - ::TreeNode.new(1) + ::TreeNode.build_tree( + [1, 2, 1] ), - ::TreeNode.new( - 1, - ::TreeNode.new(1), - ::TreeNode.new(2) + ::TreeNode.build_tree( + [1, 1, 2] ) ) ) diff --git a/test/easy/test_101_symmetric_tree.rb b/test/easy/test_101_symmetric_tree.rb index 3aab789e..b1cfebcc 100644 --- a/test/easy/test_101_symmetric_tree.rb +++ b/test/easy/test_101_symmetric_tree.rb @@ -9,18 +9,8 @@ class SymmetricTreeTest < ::Minitest::Test def test_default_one assert( is_symmetric( - ::TreeNode.new( - 1, - ::TreeNode.new( - 2, - ::TreeNode.new(3), - ::TreeNode.new(4) - ), - ::TreeNode.new( - 2, - ::TreeNode.new(4), - ::TreeNode.new(3) - ) + ::TreeNode.build_tree( + [1, 2, 2, 3, 4, 4, 3] ) ) ) @@ -29,18 +19,8 @@ def test_default_one def test_default_two assert( !is_symmetric( - ::TreeNode.new( - 1, - ::TreeNode.new( - 2, - nil, - ::TreeNode.new(3) - ), - ::TreeNode.new( - 2, - nil, - ::TreeNode.new(3) - ) + ::TreeNode.build_tree( + [1, 2, 2, nil, 3, nil, 3] ) ) ) diff --git a/test/easy/test_104_maximum_depth_of_binary_tree.rb b/test/easy/test_104_maximum_depth_of_binary_tree.rb index 7678daa8..e954196c 100644 --- a/test/easy/test_104_maximum_depth_of_binary_tree.rb +++ b/test/easy/test_104_maximum_depth_of_binary_tree.rb @@ -10,14 +10,8 @@ def test_default_one assert_equal( 3, max_depth( - ::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] ) ) ) @@ -27,10 +21,8 @@ def test_default_two assert_equal( 2, max_depth( - ::TreeNode.new( - 1, - nil, - ::TreeNode.new(2) + ::TreeNode.build_tree( + [1, nil, 2] ) ) ) diff --git a/test/easy/test_110_balanced_binary_tree.rb b/test/easy/test_110_balanced_binary_tree.rb index 217fd32b..6c52197c 100644 --- a/test/easy/test_110_balanced_binary_tree.rb +++ b/test/easy/test_110_balanced_binary_tree.rb @@ -9,14 +9,8 @@ class BalancedBinaryTreeTest < ::Minitest::Test def test_default_one assert( is_balanced( - ::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] ) ) ) @@ -25,18 +19,8 @@ def test_default_one def test_default_two assert( !is_balanced( - ::TreeNode.new( - 1, - ::TreeNode.new( - 2, - ::TreeNode.new( - 3, - ::TreeNode.new(4), - ::TreeNode.new(4) - ), - ::TreeNode.new(3) - ), - ::TreeNode.new(2) + ::TreeNode.build_tree( + [1, 2, 2, 3, 3, nil, nil, 4, 4] ) ) ) diff --git a/test/easy/test_111_minimum_depth_of_binary_tree.rb b/test/easy/test_111_minimum_depth_of_binary_tree.rb index 62cc12ca..71574a8d 100644 --- a/test/easy/test_111_minimum_depth_of_binary_tree.rb +++ b/test/easy/test_111_minimum_depth_of_binary_tree.rb @@ -10,14 +10,8 @@ def test_default_one assert_equal( 2, min_depth( - ::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] ) ) ) @@ -27,22 +21,8 @@ def test_default_two assert_equal( 5, min_depth( - ::TreeNode.new( - 2, - nil, - ::TreeNode.new( - 3, - nil, - ::TreeNode.new( - 4, - nil, - ::TreeNode.new( - 5, - nil, - ::TreeNode.new(6) - ) - ) - ) + ::TreeNode.build_tree( + [2, nil, 3, nil, 4, nil, 5, nil, 6] ) ) ) diff --git a/test/easy/test_112_path_sum.rb b/test/easy/test_112_path_sum.rb index 414e47d3..63220e56 100644 --- a/test/easy/test_112_path_sum.rb +++ b/test/easy/test_112_path_sum.rb @@ -9,25 +9,8 @@ class PathSumTest < ::Minitest::Test def test_default_one assert( has_path_sum( - ::TreeNode.new( - 5, - ::TreeNode.new( - 4, - ::TreeNode.new( - 11, - ::TreeNode.new(7), - ::TreeNode.new(2) - ) - ), - ::TreeNode.new( - 8, - ::TreeNode.new(13), - ::TreeNode.new( - 4, - nil, - ::TreeNode.new(1) - ) - ) + ::TreeNode.build_tree( + [5, 4, 8, 11, nil, 13, 4, 7, 2, nil, nil, nil, 1] ), 22 ) @@ -37,10 +20,8 @@ def test_default_one def test_default_two assert( !has_path_sum( - ::TreeNode.new( - 1, - ::TreeNode.new(2), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [1, 2, 3] ), 5 ) diff --git a/test/easy/test_144_binary_tree_preorder_traversal.rb b/test/easy/test_144_binary_tree_preorder_traversal.rb index 6f032e28..f169dbad 100644 --- a/test/easy/test_144_binary_tree_preorder_traversal.rb +++ b/test/easy/test_144_binary_tree_preorder_traversal.rb @@ -10,13 +10,8 @@ def test_default_one assert_equal( [1, 2, 3], preorder_traversal( - ::TreeNode.new( - 1, - nil, - ::TreeNode.new( - 2, - ::TreeNode.new(3) - ) + ::TreeNode.build_tree( + [1, nil, 2, 3] ) ) ) @@ -33,7 +28,9 @@ def test_default_three assert_equal( [1], preorder_traversal( - ::TreeNode.new(1) + ::TreeNode.build_tree( + [1] + ) ) ) end diff --git a/test/easy/test_145_binary_tree_postorder_traversal.rb b/test/easy/test_145_binary_tree_postorder_traversal.rb index f929dd39..5727407f 100644 --- a/test/easy/test_145_binary_tree_postorder_traversal.rb +++ b/test/easy/test_145_binary_tree_postorder_traversal.rb @@ -10,13 +10,8 @@ def test_default_one assert_equal( [3, 2, 1], postorder_traversal( - ::TreeNode.new( - 1, - nil, - ::TreeNode.new( - 2, - ::TreeNode.new(3) - ) + ::TreeNode.build_tree( + [1, nil, 2, 3] ) ) ) @@ -33,7 +28,9 @@ def test_default_three assert_equal( [1], postorder_traversal( - ::TreeNode.new(1) + ::TreeNode.build_tree( + [1] + ) ) ) end diff --git a/test/easy/test_226_invert_binary_tree.rb b/test/easy/test_226_invert_binary_tree.rb index a61c0c78..fa01bd99 100644 --- a/test/easy/test_226_invert_binary_tree.rb +++ b/test/easy/test_226_invert_binary_tree.rb @@ -9,32 +9,12 @@ class InvertBinaryTreeTest < ::Minitest::Test def test_default_one assert( ::TreeNode.are_equals( - ::TreeNode.new( - 4, - ::TreeNode.new( - 7, - ::TreeNode.new(9), - ::TreeNode.new(6) - ), - ::TreeNode.new( - 2, - ::TreeNode.new(3), - ::TreeNode.new(1) - ) + ::TreeNode.build_tree( + [4, 7, 2, 9, 6, 3, 1] ), invert_tree( - ::TreeNode.new( - 4, - ::TreeNode.new( - 2, - ::TreeNode.new(1), - ::TreeNode.new(3) - ), - ::TreeNode.new( - 7, - ::TreeNode.new(6), - ::TreeNode.new(9) - ) + ::TreeNode.build_tree( + [4, 2, 7, 1, 3, 6, 9] ) ) ) @@ -44,16 +24,12 @@ def test_default_one def test_default_two assert( ::TreeNode.are_equals( - ::TreeNode.new( - 2, - ::TreeNode.new(1), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [2, 3, 1] ), invert_tree( - ::TreeNode.new( - 2, - ::TreeNode.new(3), - ::TreeNode.new(1) + ::TreeNode.build_tree( + [2, 1, 3] ) ) ) diff --git a/test/easy/test_257_binary_tree_paths.rb b/test/easy/test_257_binary_tree_paths.rb index e2152e70..079acd37 100644 --- a/test/easy/test_257_binary_tree_paths.rb +++ b/test/easy/test_257_binary_tree_paths.rb @@ -10,14 +10,8 @@ def test_default_one assert_equal( %w[1->2->5 1->3], binary_tree_paths( - ::TreeNode.new( - 1, - ::TreeNode.new( - 2, - nil, - ::TreeNode.new(5) - ), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [1, 2, 3, nil, 5] ) ) ) @@ -27,7 +21,9 @@ def test_default_two assert_equal( ['1'], binary_tree_paths( - ::TreeNode.new(1) + ::TreeNode.build_tree( + [1] + ) ) ) end diff --git a/test/easy/test_404_sum_of_left_leaves.rb b/test/easy/test_404_sum_of_left_leaves.rb index 4bc83c22..e9c76d97 100644 --- a/test/easy/test_404_sum_of_left_leaves.rb +++ b/test/easy/test_404_sum_of_left_leaves.rb @@ -10,14 +10,8 @@ def test_default_one assert_equal( 24, sum_of_left_leaves( - ::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] ) ) ) @@ -27,7 +21,9 @@ def test_default_two assert_equal( 0, sum_of_left_leaves( - ::TreeNode.new(1) + ::TreeNode.build_tree( + [1] + ) ) ) end @@ -36,14 +32,8 @@ def test_additional_one assert_equal( 4, sum_of_left_leaves( - ::TreeNode.new( - 1, - ::TreeNode.new( - 2, - ::TreeNode.new(4), - ::TreeNode.new(5) - ), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [1, 2, 3, 4, 5] ) ) ) diff --git a/test/easy/test_501_find_mode_in_binary_search_tree.rb b/test/easy/test_501_find_mode_in_binary_search_tree.rb index 5b84558b..4cb81a6a 100644 --- a/test/easy/test_501_find_mode_in_binary_search_tree.rb +++ b/test/easy/test_501_find_mode_in_binary_search_tree.rb @@ -10,14 +10,8 @@ def test_default_one assert_equal( [2], find_mode( - ::TreeNode.new( - 1, - nil, - ::TreeNode.new( - 2, - ::TreeNode.new(2), - nil - ) + ::TreeNode.build_tree( + [1, nil, 2, 2] ) ) ) @@ -27,7 +21,9 @@ def test_default_two assert_equal( [0], find_mode( - ::TreeNode.new(0) + ::TreeNode.build_tree( + [0] + ) ) ) end diff --git a/test/easy/test_530_minimum_absolute_difference_in_bst.rb b/test/easy/test_530_minimum_absolute_difference_in_bst.rb index 7d31376b..dd17ecd9 100644 --- a/test/easy/test_530_minimum_absolute_difference_in_bst.rb +++ b/test/easy/test_530_minimum_absolute_difference_in_bst.rb @@ -10,14 +10,8 @@ def test_default_one assert_equal( 1, get_minimum_difference( - ::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, get_minimum_difference( - ::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_543_diameter_of_binary_tree.rb b/test/easy/test_543_diameter_of_binary_tree.rb index 22035947..74e89382 100644 --- a/test/easy/test_543_diameter_of_binary_tree.rb +++ b/test/easy/test_543_diameter_of_binary_tree.rb @@ -10,14 +10,8 @@ def test_default_one assert_equal( 3, diameter_of_binary_tree( - ::TreeNode.new( - 1, - ::TreeNode.new( - 2, - ::TreeNode.new(4), - ::TreeNode.new(5) - ), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [1, 2, 3, 4, 5] ) ) ) @@ -27,10 +21,8 @@ def test_default_two assert_equal( 1, diameter_of_binary_tree( - ::TreeNode.new( - 1, - ::TreeNode.new(2), - nil + ::TreeNode.build_tree( + [1, 2] ) ) ) diff --git a/test/easy/test_563_binary_tree_tilt.rb b/test/easy/test_563_binary_tree_tilt.rb index cf6c182a..ec2c6808 100644 --- a/test/easy/test_563_binary_tree_tilt.rb +++ b/test/easy/test_563_binary_tree_tilt.rb @@ -10,10 +10,8 @@ def test_default_one assert_equal( 1, find_tilt( - ::TreeNode.new( - 1, - ::TreeNode.new(2), - ::TreeNode.new(3) + ::TreeNode.build_tree( + [1, 2, 3] ) ) ) @@ -23,18 +21,8 @@ def test_default_two assert_equal( 15, find_tilt( - ::TreeNode.new( - 4, - ::TreeNode.new( - 2, - ::TreeNode.new(3), - ::TreeNode.new(5) - ), - ::TreeNode.new( - 9, - nil, - ::TreeNode.new(7) - ) + ::TreeNode.build_tree( + [4, 2, 9, 3, 5, nil, 7] ) ) ) @@ -44,22 +32,8 @@ def test_default_three assert_equal( 9, find_tilt( - ::TreeNode.new( - 21, - ::TreeNode.new( - 7, - ::TreeNode.new( - 1, - ::TreeNode.new(3), - ::TreeNode.new(3) - ), - ::TreeNode.new(1) - ), - ::TreeNode.new( - 14, - ::TreeNode.new(2), - ::TreeNode.new(2) - ) + ::TreeNode.build_tree( + [21, 7, 14, 1, 1, 2, 2, 3, 3] ) ) ) diff --git a/test/easy/test_572_subtree_of_another_tree.rb b/test/easy/test_572_subtree_of_another_tree.rb index 15e0ded4..306f11ab 100644 --- a/test/easy/test_572_subtree_of_another_tree.rb +++ b/test/easy/test_572_subtree_of_another_tree.rb @@ -9,19 +9,11 @@ class SubtreeOfAnotherTreeTest < ::Minitest::Test def test_default_one assert( is_subtree( - ::TreeNode.new( - 3, - ::TreeNode.new( - 4, - ::TreeNode.new(1), - ::TreeNode.new(2) - ), - ::TreeNode.new(5) + ::TreeNode.build_tree( + [3, 4, 5, 1, 2] ), - ::TreeNode.new( - 4, - ::TreeNode.new(1), - ::TreeNode.new(2) + ::TreeNode.build_tree( + [4, 1, 2] ) ) ) @@ -30,23 +22,11 @@ def test_default_one def test_default_two assert( !is_subtree( - ::TreeNode.new( - 3, - ::TreeNode.new( - 4, - ::TreeNode.new(1), - ::TreeNode.new( - 2, - nil, - ::TreeNode.new(0) - ) - ), - ::TreeNode.new(5) + ::TreeNode.build_tree( + [3, 4, 5, 1, 2, nil, nil, nil, nil, 0] ), - ::TreeNode.new( - 4, - ::TreeNode.new(1), - ::TreeNode.new(2) + ::TreeNode.build_tree( + [4, 1, 2] ) ) ) diff --git a/test/easy/test_94_binary_tree_inorder_traversal.rb b/test/easy/test_94_binary_tree_inorder_traversal.rb index 4cdc0721..ba587133 100644 --- a/test/easy/test_94_binary_tree_inorder_traversal.rb +++ b/test/easy/test_94_binary_tree_inorder_traversal.rb @@ -10,13 +10,8 @@ def test_default_one assert_equal( [1, 3, 2], inorder_traversal( - ::TreeNode.new( - 1, - nil, - ::TreeNode.new( - 2, - ::TreeNode.new(3) - ) + ::TreeNode.build_tree( + [1, nil, 2, 3] ) ) ) @@ -33,7 +28,9 @@ def test_default_three assert_equal( [1], inorder_traversal( - ::TreeNode.new(1) + ::TreeNode.build_tree( + [1] + ) ) ) end