-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_897_increasing_order_search_tree.rb
94 lines (91 loc) · 1.97 KB
/
test_897_increasing_order_search_tree.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
# frozen_string_literal: true
require_relative '../test_helper'
require_relative '../../lib/common/binary_tree'
require_relative '../../lib/easy/897_increasing_order_search_tree'
require 'minitest/autorun'
class IncreasingOrderSearchTreeTest < ::Minitest::Test
def test_default_one
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,
nil,
::TreeNode.new(
7,
nil,
::TreeNode.new(
8,
nil,
::TreeNode.new(9)
)
)
)
)
)
)
)
),
increasing_bst(
::TreeNode.new(
5,
::TreeNode.new(
3,
::TreeNode.new(
2,
::TreeNode.new(1),
nil
),
::TreeNode.new(4)
),
::TreeNode.new(
6,
nil,
::TreeNode.new(
8,
::TreeNode.new(7),
::TreeNode.new(9)
)
)
)
)
)
)
end
def test_default_two
assert(
::TreeNode.are_equals(
::TreeNode.new(
1,
nil,
::TreeNode.new(
5,
nil,
::TreeNode.new(7)
)
),
increasing_bst(
::TreeNode.new(
5,
::TreeNode.new(1),
::TreeNode.new(7)
)
)
)
)
end
end