Skip to content

Commit cce2d2c

Browse files
fartemfartem
authored
2025-01-23 v. 8.2.5.1: updated TreeNode initialization for tests
2 parents 739fc88 + 9889678 commit cce2d2c

12 files changed

+81
-203
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'
8+
s.version = '8.2.5.1'
99
s.license = 'MIT'
1010
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
1111
s.executable = 'leetcode-ruby'

‎test/medium/test_102_binary_tree_level_order_traversal.rb‎

Lines changed: 5 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -14,14 +14,8 @@ def test_default_one
1414
[15, 7]
1515
],
1616
level_order(
17-
::TreeNode.new(
18-
3,
19-
::TreeNode.new(9),
20-
::TreeNode.new(
21-
20,
22-
::TreeNode.new(15),
23-
::TreeNode.new(7)
24-
)
17+
::TreeNode.build_tree(
18+
[3, 9, 20, nil, nil, 15, 7]
2519
)
2620
)
2721
)
@@ -33,7 +27,9 @@ def test_default_two
3327
[1]
3428
],
3529
level_order(
36-
::TreeNode.new(1)
30+
::TreeNode.build_tree(
31+
[1]
32+
)
3733
)
3834
)
3935
end

‎test/medium/test_103_binary_tree_zigzag_level_order_traversal.rb‎

Lines changed: 5 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -14,14 +14,8 @@ def test_default_one
1414
[15, 7]
1515
],
1616
zigzag_level_order(
17-
::TreeNode.new(
18-
3,
19-
::TreeNode.new(9),
20-
::TreeNode.new(
21-
20,
22-
::TreeNode.new(15),
23-
::TreeNode.new(7)
24-
)
17+
::TreeNode.build_tree(
18+
[3, 9, 20, nil, nil, 15, 7]
2519
)
2620
)
2721
)
@@ -33,7 +27,9 @@ def test_default_two
3327
[1]
3428
],
3529
zigzag_level_order(
36-
::TreeNode.new(1)
30+
::TreeNode.build_tree(
31+
[1]
32+
)
3733
)
3834
)
3935
end

‎test/medium/test_105_construct_binary_tree_from_preorder_and_inorder_traversal.rb‎

Lines changed: 9 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -9,14 +9,8 @@ class ConstructBinaryTreeFromPreorderAndInorderTraversalTest < ::Minitest::Test
99
def test_default_one
1010
assert(
1111
::TreeNode.are_equals(
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
build_tree(
2216
[3, 9, 20, 15, 7],
@@ -29,8 +23,13 @@ def test_default_one
2923
def test_default_two
3024
assert(
3125
::TreeNode.are_equals(
32-
::TreeNode.new(-1),
33-
build_tree([-1], [-1])
26+
::TreeNode.build_tree(
27+
[-1]
28+
),
29+
build_tree(
30+
[-1],
31+
[-1]
32+
)
3433
)
3534
)
3635
end

‎test/medium/test_106_construct_binary_tree_from_inorder_and_postorder_traversal.rb‎

Lines changed: 9 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -9,14 +9,8 @@ class ConstructBinaryTreeFromInorderAndPostorderTraversalTest < ::Minitest::Test
99
def test_default_one
1010
assert(
1111
::TreeNode.are_equals(
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
build_tree106(
2216
[9, 3, 15, 20, 7],
@@ -29,8 +23,13 @@ def test_default_one
2923
def test_default_two
3024
assert(
3125
::TreeNode.are_equals(
32-
::TreeNode.new(-1),
33-
build_tree106([-1], [-1])
26+
::TreeNode.build_tree(
27+
[-1]
28+
),
29+
build_tree106(
30+
[-1],
31+
[-1]
32+
)
3433
)
3534
)
3635
end

‎test/medium/test_107_binary_tree_level_order_traversal_ii.rb‎

Lines changed: 5 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -14,14 +14,8 @@ def test_default_one
1414
[3]
1515
],
1616
level_order_bottom(
17-
::TreeNode.new(
18-
3,
19-
::TreeNode.new(9),
20-
::TreeNode.new(
21-
20,
22-
::TreeNode.new(15),
23-
::TreeNode.new(7)
24-
)
17+
::TreeNode.build_tree(
18+
[3, 9, 20, nil, nil, 15, 7]
2519
)
2620
)
2721
)
@@ -33,7 +27,9 @@ def test_default_two
3327
[1]
3428
],
3529
level_order_bottom(
36-
::TreeNode.new(1)
30+
::TreeNode.build_tree(
31+
[1]
32+
)
3733
)
3834
)
3935
end

‎test/medium/test_109_convert_sorted_list_to_binary_search_tree.rb‎

Lines changed: 2 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -10,18 +10,8 @@ class ConvertSortedListToBinarySearchTreeTest < ::Minitest::Test
1010
def test_default_one
1111
assert(
1212
::TreeNode.are_equals(
13-
::TreeNode.new(
14-
0,
15-
::TreeNode.new(
16-
-3,
17-
::TreeNode.new(-10),
18-
nil
19-
),
20-
::TreeNode.new(
21-
9,
22-
::TreeNode.new(5),
23-
nil
24-
)
13+
::TreeNode.build_tree(
14+
[0, -3, 9, -10, nil, 5]
2515
),
2616
sorted_list_to_bst(
2717
::ListNode.from_array(

‎test/medium/test_113_path_sum_ii.rb‎

Lines changed: 6 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -13,26 +13,8 @@ def test_default_one
1313
[5, 8, 4, 5]
1414
],
1515
path_sum(
16-
::TreeNode.new(
17-
5,
18-
::TreeNode.new(
19-
4,
20-
::TreeNode.new(
21-
11,
22-
::TreeNode.new(7),
23-
::TreeNode.new(2)
24-
),
25-
nil
26-
),
27-
::TreeNode.new(
28-
8,
29-
::TreeNode.new(13),
30-
::TreeNode.new(
31-
4,
32-
::TreeNode.new(5),
33-
::TreeNode.new(1)
34-
)
35-
)
16+
::TreeNode.build_tree(
17+
[5, 4, 8, 11, nil, 13, 4, 7, 2, nil, nil, 5, 1]
3618
),
3719
22
3820
)
@@ -43,10 +25,8 @@ def test_default_two
4325
assert_equal(
4426
[],
4527
path_sum(
46-
::TreeNode.new(
47-
1,
48-
::TreeNode.new(2),
49-
::TreeNode.new(3)
28+
::TreeNode.build_tree(
29+
[1, 2, 3]
5030
),
5131
5
5232
)
@@ -57,10 +37,8 @@ def test_default_three
5737
assert_empty(
5838
[],
5939
path_sum(
60-
::TreeNode.new(
61-
1,
62-
::TreeNode.new(2),
63-
nil
40+
::TreeNode.build_tree(
41+
[1, 2]
6442
),
6543
0
6644
)

‎test/medium/test_114_flatten_binary_tree_to_linked_list.rb‎

Lines changed: 10 additions & 34 deletions
Original file line numberDiff line numberDiff line change
@@ -7,43 +7,15 @@
77

88
class FlattenBinaryTreeToLinkedListTest < ::Minitest::Test
99
def test_default_one
10-
input = ::TreeNode.new(
11-
1,
12-
::TreeNode.new(
13-
2,
14-
::TreeNode.new(3),
15-
::TreeNode.new(4)
16-
),
17-
::TreeNode.new(
18-
5,
19-
::TreeNode.new(6),
20-
nil
21-
)
10+
input = ::TreeNode.build_tree(
11+
[1, 2, 5, 3, 4, nil, 6]
2212
)
2313
flatten(input)
2414

2515
assert(
2616
::TreeNode.are_equals(
27-
::TreeNode.new(
28-
1,
29-
nil,
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-
)
46-
)
17+
::TreeNode.build_tree(
18+
[1, nil, 2, nil, 3, nil, 4, nil, 5, nil, 6]
4719
),
4820
input
4921
)
@@ -58,12 +30,16 @@ def test_default_two
5830
end
5931

6032
def test_default_three
61-
input = ::TreeNode.new(0)
33+
input = ::TreeNode.build_tree(
34+
[0]
35+
)
6236
flatten(input)
6337

6438
assert(
6539
::TreeNode.are_equals(
66-
::TreeNode.new(0),
40+
::TreeNode.build_tree(
41+
[0]
42+
),
6743
input
6844
)
6945
)

‎test/medium/test_95_unique_binary_search_trees_ii.rb‎

Lines changed: 17 additions & 37 deletions
Original file line numberDiff line numberDiff line change
@@ -8,51 +8,26 @@
88
class UniqueBinarySearchTreesIITest < ::Minitest::Test
99
def test_default_one
1010
input = [
11-
::TreeNode.new(
12-
1,
13-
nil,
14-
::TreeNode.new(
15-
2,
16-
nil,
17-
::TreeNode.new(3)
18-
)
11+
::TreeNode.build_tree(
12+
[1, nil, 2, nil, 3]
1913
),
20-
::TreeNode.new(
21-
1,
22-
nil,
23-
::TreeNode.new(
24-
3,
25-
::TreeNode.new(2),
26-
nil
27-
)
14+
::TreeNode.build_tree(
15+
[1, nil, 3, 2]
2816
),
29-
::TreeNode.new(
30-
2,
31-
::TreeNode.new(1),
32-
::TreeNode.new(3)
17+
::TreeNode.build_tree(
18+
[2, 1, 3]
3319
),
34-
::TreeNode.new(
35-
3,
36-
::TreeNode.new(
37-
1,
38-
nil,
39-
::TreeNode.new(2)
40-
),
41-
nil
20+
::TreeNode.build_tree(
21+
[3, 1, nil, nil, 2]
4222
),
43-
::TreeNode.new(
44-
3,
45-
::TreeNode.new(
46-
2,
47-
::TreeNode.new(1),
48-
nil
49-
),
50-
nil
23+
::TreeNode.build_tree(
24+
[3, 2, nil, 1]
5125
)
5226
]
5327
output = generate_trees(3)
5428

5529
assert_equal(input.length, output.length)
30+
5631
(0..input.length).each do |i|
5732
assert(
5833
::TreeNode.are_equals(
@@ -64,10 +39,15 @@ def test_default_one
6439
end
6540

6641
def test_default_two
67-
input = [::TreeNode.new(1)]
42+
input = [
43+
::TreeNode.build_tree(
44+
[1]
45+
)
46+
]
6847
output = generate_trees(1)
6948

7049
assert_equal(input.length, output.length)
50+
7151
(0..input.length).each do |i|
7252
assert(
7353
::TreeNode.are_equals(

0 commit comments

Comments
 (0)