Skip to content

2025-01-23 v. 8.2.5.1: updated TreeNode initialization for tests #904

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jan 23, 2025
Merged

2025-01-23 v. 8.2.5.1: updated TreeNode initialization for tests #904

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion leetcode-ruby.gemspec
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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'
s.version = '8.2.5.1'
s.license = 'MIT'
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
s.executable = 'leetcode-ruby'
Expand Down
14 changes: 5 additions & 9 deletions test/medium/test_102_binary_tree_level_order_traversal.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,14 +14,8 @@ def test_default_one
[15, 7]
],
level_order(
::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]
)
)
)
Expand All @@ -33,7 +27,9 @@ def test_default_two
[1]
],
level_order(
::TreeNode.new(1)
::TreeNode.build_tree(
[1]
)
)
)
end
Expand Down
14 changes: 5 additions & 9 deletions test/medium/test_103_binary_tree_zigzag_level_order_traversal.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,14 +14,8 @@ def test_default_one
[15, 7]
],
zigzag_level_order(
::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]
)
)
)
Expand All @@ -33,7 +27,9 @@ def test_default_two
[1]
],
zigzag_level_order(
::TreeNode.new(1)
::TreeNode.build_tree(
[1]
)
)
)
end
Expand Down
19 changes: 9 additions & 10 deletions test/medium/test_105_construct_binary_tree_from_preorder_and_inorder_traversal.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,14 +9,8 @@ class ConstructBinaryTreeFromPreorderAndInorderTraversalTest < ::Minitest::Test
def test_default_one
assert(
::TreeNode.are_equals(
::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]
),
build_tree(
[3, 9, 20, 15, 7],
Expand All @@ -29,8 +23,13 @@ def test_default_one
def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(-1),
build_tree([-1], [-1])
::TreeNode.build_tree(
[-1]
),
build_tree(
[-1],
[-1]
)
)
)
end
Expand Down
19 changes: 9 additions & 10 deletions test/medium/test_106_construct_binary_tree_from_inorder_and_postorder_traversal.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,14 +9,8 @@ class ConstructBinaryTreeFromInorderAndPostorderTraversalTest < ::Minitest::Test
def test_default_one
assert(
::TreeNode.are_equals(
::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]
),
build_tree106(
[9, 3, 15, 20, 7],
Expand All @@ -29,8 +23,13 @@ def test_default_one
def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(-1),
build_tree106([-1], [-1])
::TreeNode.build_tree(
[-1]
),
build_tree106(
[-1],
[-1]
)
)
)
end
Expand Down
14 changes: 5 additions & 9 deletions test/medium/test_107_binary_tree_level_order_traversal_ii.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -14,14 +14,8 @@ def test_default_one
[3]
],
level_order_bottom(
::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]
)
)
)
Expand All @@ -33,7 +27,9 @@ def test_default_two
[1]
],
level_order_bottom(
::TreeNode.new(1)
::TreeNode.build_tree(
[1]
)
)
)
end
Expand Down
14 changes: 2 additions & 12 deletions test/medium/test_109_convert_sorted_list_to_binary_search_tree.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,18 +10,8 @@ class ConvertSortedListToBinarySearchTreeTest < ::Minitest::Test
def test_default_one
assert(
::TreeNode.are_equals(
::TreeNode.new(
0,
::TreeNode.new(
-3,
::TreeNode.new(-10),
nil
),
::TreeNode.new(
9,
::TreeNode.new(5),
nil
)
::TreeNode.build_tree(
[0, -3, 9, -10, nil, 5]
),
sorted_list_to_bst(
::ListNode.from_array(
Expand Down
34 changes: 6 additions & 28 deletions test/medium/test_113_path_sum_ii.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,26 +13,8 @@ def test_default_one
[5, 8, 4, 5]
],
path_sum(
::TreeNode.new(
5,
::TreeNode.new(
4,
::TreeNode.new(
11,
::TreeNode.new(7),
::TreeNode.new(2)
),
nil
),
::TreeNode.new(
8,
::TreeNode.new(13),
::TreeNode.new(
4,
::TreeNode.new(5),
::TreeNode.new(1)
)
)
::TreeNode.build_tree(
[5, 4, 8, 11, nil, 13, 4, 7, 2, nil, nil, 5, 1]
),
22
)
Expand All @@ -43,10 +25,8 @@ def test_default_two
assert_equal(
[],
path_sum(
::TreeNode.new(
1,
::TreeNode.new(2),
::TreeNode.new(3)
::TreeNode.build_tree(
[1, 2, 3]
),
5
)
Expand All @@ -57,10 +37,8 @@ def test_default_three
assert_empty(
[],
path_sum(
::TreeNode.new(
1,
::TreeNode.new(2),
nil
::TreeNode.build_tree(
[1, 2]
),
0
)
Expand Down
44 changes: 10 additions & 34 deletions test/medium/test_114_flatten_binary_tree_to_linked_list.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,43 +7,15 @@

class FlattenBinaryTreeToLinkedListTest < ::Minitest::Test
def test_default_one
input = ::TreeNode.new(
1,
::TreeNode.new(
2,
::TreeNode.new(3),
::TreeNode.new(4)
),
::TreeNode.new(
5,
::TreeNode.new(6),
nil
)
input = ::TreeNode.build_tree(
[1, 2, 5, 3, 4, nil, 6]
)
flatten(input)

assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
nil,
::TreeNode.new(
2,
nil,
::TreeNode.new(
3,
nil,
::TreeNode.new(
4,
nil,
::TreeNode.new(
5,
nil,
::TreeNode.new(6)
)
)
)
)
::TreeNode.build_tree(
[1, nil, 2, nil, 3, nil, 4, nil, 5, nil, 6]
),
input
)
Expand All @@ -58,12 +30,16 @@ def test_default_two
end

def test_default_three
input = ::TreeNode.new(0)
input = ::TreeNode.build_tree(
[0]
)
flatten(input)

assert(
::TreeNode.are_equals(
::TreeNode.new(0),
::TreeNode.build_tree(
[0]
),
input
)
)
Expand Down
54 changes: 17 additions & 37 deletions test/medium/test_95_unique_binary_search_trees_ii.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,51 +8,26 @@
class UniqueBinarySearchTreesIITest < ::Minitest::Test
def test_default_one
input = [
::TreeNode.new(
1,
nil,
::TreeNode.new(
2,
nil,
::TreeNode.new(3)
)
::TreeNode.build_tree(
[1, nil, 2, nil, 3]
),
::TreeNode.new(
1,
nil,
::TreeNode.new(
3,
::TreeNode.new(2),
nil
)
::TreeNode.build_tree(
[1, nil, 3, 2]
),
::TreeNode.new(
2,
::TreeNode.new(1),
::TreeNode.new(3)
::TreeNode.build_tree(
[2, 1, 3]
),
::TreeNode.new(
3,
::TreeNode.new(
1,
nil,
::TreeNode.new(2)
),
nil
::TreeNode.build_tree(
[3, 1, nil, nil, 2]
),
::TreeNode.new(
3,
::TreeNode.new(
2,
::TreeNode.new(1),
nil
),
nil
::TreeNode.build_tree(
[3, 2, nil, 1]
)
]
output = generate_trees(3)

assert_equal(input.length, output.length)

(0..input.length).each do |i|
assert(
::TreeNode.are_equals(
Expand All @@ -64,10 +39,15 @@ def test_default_one
end

def test_default_two
input = [::TreeNode.new(1)]
input = [
::TreeNode.build_tree(
[1]
)
]
output = generate_trees(1)

assert_equal(input.length, output.length)

(0..input.length).each do |i|
assert(
::TreeNode.are_equals(
Expand Down
Loading
Loading