Skip to content

Commit 3389a0a

Browse files
fartemfartem
authored
2025-01-23 v. 8.2.5.5: updated TreeNode initialization for tests
2 parents f0c7430 + f32f8f3 commit 3389a0a

18 files changed

+95
-304
lines changed

‎leetcode-ruby.gemspec

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ require 'English'
55
::Gem::Specification.new do |s|
66
s.required_ruby_version = '>= 3.0'
77
s.name = 'leetcode-ruby'
8-
s.version = '8.2.5.4'
8+
s.version = '8.2.5.5'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'

‎test/easy/test_100_same_tree.rb

Lines changed: 12 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -9,15 +9,11 @@ class SameTreeTest < ::Minitest::Test
99
def test_default_one
1010
assert(
1111
is_same_tree(
12-
::TreeNode.new(
13-
1,
14-
::TreeNode.new(2),
15-
::TreeNode.new(3)
12+
::TreeNode.build_tree(
13+
[1, 2, 3]
1614
),
17-
::TreeNode.new(
18-
1,
19-
::TreeNode.new(2),
20-
::TreeNode.new(3)
15+
::TreeNode.build_tree(
16+
[1, 2, 3]
2117
)
2218
)
2319
)
@@ -26,12 +22,11 @@ def test_default_one
2622
def test_default_two
2723
assert(
2824
!is_same_tree(
29-
::TreeNode.new(
30-
::TreeNode.new(2)
25+
::TreeNode.build_tree(
26+
[1, 2]
3127
),
32-
::TreeNode.new(
33-
nil,
34-
::TreeNode.new(2)
28+
::TreeNode.build_tree(
29+
[1, nil, 2]
3530
)
3631
)
3732
)
@@ -40,15 +35,11 @@ def test_default_two
4035
def test_default_three
4136
assert(
4237
!is_same_tree(
43-
::TreeNode.new(
44-
1,
45-
::TreeNode.new(2),
46-
::TreeNode.new(1)
38+
::TreeNode.build_tree(
39+
[1, 2, 1]
4740
),
48-
::TreeNode.new(
49-
1,
50-
::TreeNode.new(1),
51-
::TreeNode.new(2)
41+
::TreeNode.build_tree(
42+
[1, 1, 2]
5243
)
5344
)
5445
)

‎test/easy/test_101_symmetric_tree.rb

Lines changed: 4 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -9,18 +9,8 @@ class SymmetricTreeTest < ::Minitest::Test
99
def test_default_one
1010
assert(
1111
is_symmetric(
12-
::TreeNode.new(
13-
1,
14-
::TreeNode.new(
15-
2,
16-
::TreeNode.new(3),
17-
::TreeNode.new(4)
18-
),
19-
::TreeNode.new(
20-
2,
21-
::TreeNode.new(4),
22-
::TreeNode.new(3)
23-
)
12+
::TreeNode.build_tree(
13+
[1, 2, 2, 3, 4, 4, 3]
2414
)
2515
)
2616
)
@@ -29,18 +19,8 @@ def test_default_one
2919
def test_default_two
3020
assert(
3121
!is_symmetric(
32-
::TreeNode.new(
33-
1,
34-
::TreeNode.new(
35-
2,
36-
nil,
37-
::TreeNode.new(3)
38-
),
39-
::TreeNode.new(
40-
2,
41-
nil,
42-
::TreeNode.new(3)
43-
)
22+
::TreeNode.build_tree(
23+
[1, 2, 2, nil, 3, nil, 3]
4424
)
4525
)
4626
)

‎test/easy/test_104_maximum_depth_of_binary_tree.rb

Lines changed: 4 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -10,14 +10,8 @@ def test_default_one
1010
assert_equal(
1111
3,
1212
max_depth(
13-
::TreeNode.new(
14-
3,
15-
::TreeNode.new(9),
16-
::TreeNode.new(
17-
20,
18-
::TreeNode.new(15),
19-
::TreeNode.new(7)
20-
)
13+
::TreeNode.build_tree(
14+
[3, 9, 20, nil, nil, 15, 7]
2115
)
2216
)
2317
)
@@ -27,10 +21,8 @@ def test_default_two
2721
assert_equal(
2822
2,
2923
max_depth(
30-
::TreeNode.new(
31-
1,
32-
nil,
33-
::TreeNode.new(2)
24+
::TreeNode.build_tree(
25+
[1, nil, 2]
3426
)
3527
)
3628
)

‎test/easy/test_110_balanced_binary_tree.rb

Lines changed: 4 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -9,14 +9,8 @@ class BalancedBinaryTreeTest < ::Minitest::Test
99
def test_default_one
1010
assert(
1111
is_balanced(
12-
::TreeNode.new(
13-
3,
14-
::TreeNode.new(9),
15-
::TreeNode.new(
16-
20,
17-
::TreeNode.new(15),
18-
::TreeNode.new(7)
19-
)
12+
::TreeNode.build_tree(
13+
[3, 9, 20, nil, nil, 15, 7]
2014
)
2115
)
2216
)
@@ -25,18 +19,8 @@ def test_default_one
2519
def test_default_two
2620
assert(
2721
!is_balanced(
28-
::TreeNode.new(
29-
1,
30-
::TreeNode.new(
31-
2,
32-
::TreeNode.new(
33-
3,
34-
::TreeNode.new(4),
35-
::TreeNode.new(4)
36-
),
37-
::TreeNode.new(3)
38-
),
39-
::TreeNode.new(2)
22+
::TreeNode.build_tree(
23+
[1, 2, 2, 3, 3, nil, nil, 4, 4]
4024
)
4125
)
4226
)

‎test/easy/test_111_minimum_depth_of_binary_tree.rb

Lines changed: 4 additions & 24 deletions
Original file line numberDiff line numberDiff line change
@@ -10,14 +10,8 @@ def test_default_one
1010
assert_equal(
1111
2,
1212
min_depth(
13-
::TreeNode.new(
14-
3,
15-
::TreeNode.new(9),
16-
::TreeNode.new(
17-
20,
18-
::TreeNode.new(15),
19-
::TreeNode.new(7)
20-
)
13+
::TreeNode.build_tree(
14+
[3, 9, 20, nil, nil, 15, 7]
2115
)
2216
)
2317
)
@@ -27,22 +21,8 @@ def test_default_two
2721
assert_equal(
2822
5,
2923
min_depth(
30-
::TreeNode.new(
31-
2,
32-
nil,
33-
::TreeNode.new(
34-
3,
35-
nil,
36-
::TreeNode.new(
37-
4,
38-
nil,
39-
::TreeNode.new(
40-
5,
41-
nil,
42-
::TreeNode.new(6)
43-
)
44-
)
45-
)
24+
::TreeNode.build_tree(
25+
[2, nil, 3, nil, 4, nil, 5, nil, 6]
4626
)
4727
)
4828
)

‎test/easy/test_112_path_sum.rb

Lines changed: 4 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -9,25 +9,8 @@ class PathSumTest < ::Minitest::Test
99
def test_default_one
1010
assert(
1111
has_path_sum(
12-
::TreeNode.new(
13-
5,
14-
::TreeNode.new(
15-
4,
16-
::TreeNode.new(
17-
11,
18-
::TreeNode.new(7),
19-
::TreeNode.new(2)
20-
)
21-
),
22-
::TreeNode.new(
23-
8,
24-
::TreeNode.new(13),
25-
::TreeNode.new(
26-
4,
27-
nil,
28-
::TreeNode.new(1)
29-
)
30-
)
12+
::TreeNode.build_tree(
13+
[5, 4, 8, 11, nil, 13, 4, 7, 2, nil, nil, nil, 1]
3114
),
3215
22
3316
)
@@ -37,10 +20,8 @@ def test_default_one
3720
def test_default_two
3821
assert(
3922
!has_path_sum(
40-
::TreeNode.new(
41-
1,
42-
::TreeNode.new(2),
43-
::TreeNode.new(3)
23+
::TreeNode.build_tree(
24+
[1, 2, 3]
4425
),
4526
5
4627
)

‎test/easy/test_144_binary_tree_preorder_traversal.rb

Lines changed: 5 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -10,13 +10,8 @@ def test_default_one
1010
assert_equal(
1111
[1, 2, 3],
1212
preorder_traversal(
13-
::TreeNode.new(
14-
1,
15-
nil,
16-
::TreeNode.new(
17-
2,
18-
::TreeNode.new(3)
19-
)
13+
::TreeNode.build_tree(
14+
[1, nil, 2, 3]
2015
)
2116
)
2217
)
@@ -33,7 +28,9 @@ def test_default_three
3328
assert_equal(
3429
[1],
3530
preorder_traversal(
36-
::TreeNode.new(1)
31+
::TreeNode.build_tree(
32+
[1]
33+
)
3734
)
3835
)
3936
end

‎test/easy/test_145_binary_tree_postorder_traversal.rb

Lines changed: 5 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -10,13 +10,8 @@ def test_default_one
1010
assert_equal(
1111
[3, 2, 1],
1212
postorder_traversal(
13-
::TreeNode.new(
14-
1,
15-
nil,
16-
::TreeNode.new(
17-
2,
18-
::TreeNode.new(3)
19-
)
13+
::TreeNode.build_tree(
14+
[1, nil, 2, 3]
2015
)
2116
)
2217
)
@@ -33,7 +28,9 @@ def test_default_three
3328
assert_equal(
3429
[1],
3530
postorder_traversal(
36-
::TreeNode.new(1)
31+
::TreeNode.build_tree(
32+
[1]
33+
)
3734
)
3835
)
3936
end

‎test/easy/test_226_invert_binary_tree.rb

Lines changed: 8 additions & 32 deletions
Original file line numberDiff line numberDiff line change
@@ -9,32 +9,12 @@ class InvertBinaryTreeTest < ::Minitest::Test
99
def test_default_one
1010
assert(
1111
::TreeNode.are_equals(
12-
::TreeNode.new(
13-
4,
14-
::TreeNode.new(
15-
7,
16-
::TreeNode.new(9),
17-
::TreeNode.new(6)
18-
),
19-
::TreeNode.new(
20-
2,
21-
::TreeNode.new(3),
22-
::TreeNode.new(1)
23-
)
12+
::TreeNode.build_tree(
13+
[4, 7, 2, 9, 6, 3, 1]
2414
),
2515
invert_tree(
26-
::TreeNode.new(
27-
4,
28-
::TreeNode.new(
29-
2,
30-
::TreeNode.new(1),
31-
::TreeNode.new(3)
32-
),
33-
::TreeNode.new(
34-
7,
35-
::TreeNode.new(6),
36-
::TreeNode.new(9)
37-
)
16+
::TreeNode.build_tree(
17+
[4, 2, 7, 1, 3, 6, 9]
3818
)
3919
)
4020
)
@@ -44,16 +24,12 @@ def test_default_one
4424
def test_default_two
4525
assert(
4626
::TreeNode.are_equals(
47-
::TreeNode.new(
48-
2,
49-
::TreeNode.new(1),
50-
::TreeNode.new(3)
27+
::TreeNode.build_tree(
28+
[2, 3, 1]
5129
),
5230
invert_tree(
53-
::TreeNode.new(
54-
2,
55-
::TreeNode.new(3),
56-
::TreeNode.new(1)
31+
::TreeNode.build_tree(
32+
[2, 1, 3]
5733
)
5834
)
5935
)

0 commit comments

Comments
 (0)