Skip to content

2025-01-23 v. 8.2.5.3: updated TreeNode initialization for tests #906

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.3: updated TreeNode initialization for tests #906

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.2'
s.version = '8.2.5.3'
s.license = 'MIT'
s.files = ::Dir['lib/**/*.rb'] + %w[README.md]
s.executable = 'leetcode-ruby'
Expand Down
20 changes: 4 additions & 16 deletions test/medium/test_1008_construct_binary_search_tree_from_preorder_traversal.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,18 +9,8 @@ class ConstructBinarySearchTreeFromPreorderTraversalTest < ::Minitest::Test
def test_default_one
assert(
::TreeNode.are_equals(
::TreeNode.new(
8,
::TreeNode.new(
5,
::TreeNode.new(1),
::TreeNode.new(7)
),
::TreeNode.new(
10,
nil,
::TreeNode.new(12)
)
::TreeNode.build_tree(
[8, 5, 10, 1, 7, nil, 12]
),
bst_from_preorder(
[8, 5, 1, 7, 10, 12]
Expand All @@ -32,10 +22,8 @@ def test_default_one
def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
nil,
::TreeNode.new(3)
::TreeNode.build_tree(
[1, nil, 3]
),
bst_from_preorder(
[1, 3]
Expand Down
72 changes: 24 additions & 48 deletions test/medium/test_701_insert_into_a_binary_search_tree.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,28 +9,12 @@ class InsertIntoABinarySearchTreeTest < ::Minitest::Test
def test_default_one
assert(
::TreeNode.are_equals(
::TreeNode.new(
4,
::TreeNode.new(
2,
::TreeNode.new(1),
::TreeNode.new(3)
),
::TreeNode.new(
7,
::TreeNode.new(5),
nil
)
::TreeNode.build_tree(
[4, 2, 7, 1, 3, 5]
),
insert_into_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
)
Expand All @@ -41,40 +25,32 @@ def test_default_one
def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(
40,
::TreeNode.new(
20,
::TreeNode.new(10),
::TreeNode.new(
30,
::TreeNode.new(25),
nil
)
),
::TreeNode.new(
60,
::TreeNode.new(50),
::TreeNode.new(70)
)
::TreeNode.build_tree(
[40, 20, 60, 10, 30, 50, 70, nil, nil, 25]
),
insert_into_bst(
::TreeNode.new(
40,
::TreeNode.new(
20,
::TreeNode.new(10),
::TreeNode.new(30)
),
::TreeNode.new(
60,
::TreeNode.new(50),
::TreeNode.new(70)
)
::TreeNode.build_tree(
[40, 20, 60, 10, 30, 50, 70]
),
25
)
)
)
end

def test_default_three
assert(
::TreeNode.are_equals(
::TreeNode.build_tree(
[4, 2, 7, 1, 3, 5]
),
insert_into_bst(
::TreeNode.build_tree(
[4, 2, 7, 1, 3, nil, nil, nil, nil, nil, nil]
),
5
)
)
)
end
end
82 changes: 12 additions & 70 deletions test/medium/test_814_binary_tree_pruning.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,24 +9,12 @@ class BinaryTreePruningTest < ::Minitest::Test
def test_default_one
assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
nil,
::TreeNode.new(
0,
nil,
::TreeNode.new(1)
)
::TreeNode.build_tree(
[1, nil, 0, nil, 1]
),
prune_tree(
::TreeNode.new(
1,
nil,
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(1)
)
::TreeNode.build_tree(
[1, nil, 0, 0, 1]
)
)
)
Expand All @@ -36,28 +24,12 @@ def test_default_one
def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
nil,
::TreeNode.new(
1,
nil,
::TreeNode.new(1)
)
::TreeNode.build_tree(
[1, nil, 1, nil, 1]
),
prune_tree(
::TreeNode.new(
1,
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
),
::TreeNode.new(
1,
::TreeNode.new(0),
::TreeNode.new(1)
)
::TreeNode.build_tree(
[1, 0, 1, 0, 0, 0, 1]
)
)
)
Expand All @@ -67,42 +39,12 @@ def test_default_two
def test_default_three
assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
::TreeNode.new(
1,
::TreeNode.new(
1,
::TreeNode.new(1),
::TreeNode.new(1)
)
),
::TreeNode.new(
0,
nil,
::TreeNode.new(1)
)
::TreeNode.build_tree(
[1, 1, 0, 1, 1, nil, 1]
),
prune_tree(
::TreeNode.new(
1,
::TreeNode.new(
1,
::TreeNode.new(
1,
::TreeNode.new(
1,
::TreeNode.new(0),
nil
),
::TreeNode.new(1)
)
),
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(1)
)
::TreeNode.build_tree(
[1, 1, 0, 1, 1, 0, 1, 0]
)
)
)
Expand Down
18 changes: 5 additions & 13 deletions test/medium/test_889_construct_binary_tree_from_preorder_and_postorder_traversal.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,18 +9,8 @@ class ConstructBinaryTreeFromPreorderAndPostorderTraversalTest < ::Minitest::Tes
def test_default_one
assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
::TreeNode.new(
2,
::TreeNode.new(4),
::TreeNode.new(5)
),
::TreeNode.new(
3,
::TreeNode.new(6),
::TreeNode.new(7)
)
::TreeNode.build_tree(
[1, 2, 3, 4, 5, 6, 7]
),
construct_from_pre_post(
[1, 2, 4, 5, 3, 6, 7],
Expand All @@ -33,7 +23,9 @@ def test_default_one
def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(1),
::TreeNode.build_tree(
[1]
),
construct_from_pre_post(
[1],
[1]
Expand Down
76 changes: 12 additions & 64 deletions test/medium/test_894_all_possible_full_binary_trees.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,70 +8,20 @@
class AllPossibleFullBinaryTreesTest < ::Minitest::Test
def test_default_one
correct = [
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
)
)
::TreeNode.build_tree(
[0, 0, 0, nil, nil, 0, 0, nil, nil, 0, 0]
),
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(
0,
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
),
::TreeNode.new(0)
)
::TreeNode.build_tree(
[0, 0, 0, nil, nil, 0, 0, 0, 0]
),
::TreeNode.new(
0,
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
),
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
)
::TreeNode.build_tree(
[0, 0, 0, 0, 0, 0, 0]
),
::TreeNode.new(
0,
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
)
),
::TreeNode.new(0)
::TreeNode.build_tree(
[0, 0, 0, 0, 0, nil, nil, nil, nil, 0, 0]
),
::TreeNode.new(
0,
::TreeNode.new(
0,
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
),
::TreeNode.new(0)
),
::TreeNode.new(0)
::TreeNode.build_tree(
[0, 0, 0, 0, 0, nil, nil, 0, 0]
)
]

Expand All @@ -91,10 +41,8 @@ def test_default_one

def test_default_two
correct = [
::TreeNode.new(
0,
::TreeNode.new(0),
::TreeNode.new(0)
::TreeNode.build_tree(
[0, 0, 0]
)
]

Expand Down
Loading
Loading