@@ -23,18 +23,7 @@ const BT = BinaryTrees
23
23
@test BT. value (BT. search (tree, 2 )) == 20
24
24
@test BT. value (BT. search (tree, 1 )) == 10
25
25
@test BT. value (BT. search (tree, 3 )) == 30
26
-
27
- # value conversion
28
- tree = AVLTree {Int,Float64} ()
29
- BT. insert! (tree, 2 , 20 )
30
- BT. insert! (tree, 1 , 10 )
31
- BT. insert! (tree, 3 , 30 )
32
- @test BT. value (BT. search (tree, 2 )) isa Float64
33
- @test BT. value (BT. search (tree, 2 )) == 20.0
34
- @test BT. value (BT. search (tree, 1 )) isa Float64
35
- @test BT. value (BT. search (tree, 1 )) == 10.0
36
- @test BT. value (BT. search (tree, 3 )) isa Float64
37
- @test BT. value (BT. search (tree, 3 )) == 30.0
26
+ @test isnothing (BT. search (tree, 4 ))
38
27
39
28
# update values
40
29
tree = AVLTree {Int,Int} ()
@@ -51,6 +40,18 @@ const BT = BinaryTrees
51
40
@test BT. value (BT. search (tree, 1 )) == 11
52
41
@test BT. value (BT. search (tree, 3 )) == 33
53
42
43
+ # value conversion
44
+ tree = AVLTree {Int,Float64} ()
45
+ BT. insert! (tree, 2 , 20 )
46
+ BT. insert! (tree, 1 , 10 )
47
+ BT. insert! (tree, 3 , 30 )
48
+ @test BT. value (BT. search (tree, 2 )) isa Float64
49
+ @test BT. value (BT. search (tree, 2 )) == 20.0
50
+ @test BT. value (BT. search (tree, 1 )) isa Float64
51
+ @test BT. value (BT. search (tree, 1 )) == 10.0
52
+ @test BT. value (BT. search (tree, 3 )) isa Float64
53
+ @test BT. value (BT. search (tree, 3 )) == 30.0
54
+
54
55
# right rotate
55
56
tree = AVLTree {Int,Int} ()
56
57
BT. insert! (tree, 3 , 30 )
0 commit comments