11
2- import java .util .Arrays ;
32import java .util .Collections ;
43import java .util .List ;
5- import static org . junit . Assert . assertEquals ;
6- import static org .junit . Assert . assertNotNull ;
4+
5+ import static org .assertj . core . api . Assertions . assertThat ;
76import org .junit .Ignore ;
87import org .junit .Test ;
98
@@ -17,31 +16,31 @@ public void dataIsRetained() {
1716 binarySearchTree .insert (expected );
1817
1918 BinarySearchTree .Node <Integer > root = binarySearchTree .getRoot ();
20- assertNotNull (root );
2119
22- int actual = root . getData ();
23- assertEquals ( expected , actual );
20+ assertThat ( root ). isNotNull ();
21+ assertThat ( root . getData ()). isEqualTo ( expected );
2422 }
2523
24+
2625 @ Ignore ("Remove to run test" )
2726 @ Test
2827 public void insertsLess () {
2928 BinarySearchTree <Character > binarySearchTree = new BinarySearchTree <>();
29+
3030 char expectedRoot = '4' ;
3131 char expectedLeft = '2' ;
3232
3333 binarySearchTree .insert (expectedRoot );
3434 binarySearchTree .insert (expectedLeft );
3535
3636 BinarySearchTree .Node <Character > root = binarySearchTree .getRoot ();
37- assertNotNull (root );
3837 BinarySearchTree .Node <Character > left = root .getLeft ();
39- assertNotNull (left );
4038
41- char actualRoot = root .getData ();
42- char actualLeft = left .getData ();
43- assertEquals (expectedLeft , actualLeft );
44- assertEquals (expectedRoot , actualRoot );
39+ assertThat (root ).isNotNull ();
40+ assertThat (left ).isNotNull ();
41+
42+ assertThat (root .getData ()).isEqualTo (expectedRoot );
43+ assertThat (left .getData ()).isEqualTo (expectedLeft );
4544 }
4645
4746 @ Ignore ("Remove to run test" )
@@ -55,14 +54,13 @@ public void insertsSame() {
5554 binarySearchTree .insert (expectedLeft );
5655
5756 BinarySearchTree .Node <String > root = binarySearchTree .getRoot ();
58- assertNotNull (root );
5957 BinarySearchTree .Node <String > left = root .getLeft ();
60- assertNotNull (left );
6158
62- String actualRoot = root .getData ();
63- String actualLeft = left .getData ();
64- assertEquals (expectedLeft , actualLeft );
65- assertEquals (expectedRoot , actualRoot );
59+ assertThat (root ).isNotNull ();
60+ assertThat (left ).isNotNull ();
61+
62+ assertThat (root .getData ()).isEqualTo (expectedRoot );
63+ assertThat (left .getData ()).isEqualTo (expectedLeft );
6664 }
6765
6866 @ Ignore ("Remove to run test" )
@@ -76,106 +74,83 @@ public void insertsRight() {
7674 binarySearchTree .insert (expectedRight );
7775
7876 BinarySearchTree .Node <Integer > root = binarySearchTree .getRoot ();
79- assertNotNull (root );
8077 BinarySearchTree .Node <Integer > right = root .getRight ();
81- assertNotNull (right );
8278
83- int actualRoot = root .getData ();
84- int actualRight = right .getData ();
85- assertEquals (expectedRight , actualRight );
86- assertEquals (expectedRoot , actualRoot );
79+ assertThat (root ).isNotNull ();
80+ assertThat (right ).isNotNull ();
81+
82+ assertThat (root .getData ()).isEqualTo (expectedRoot );
83+ assertThat (right .getData ()).isEqualTo (expectedRight );
8784 }
8885
8986 @ Ignore ("Remove to run test" )
9087 @ Test
9188 public void createsComplexTree () {
9289 BinarySearchTree <Character > binarySearchTree = new BinarySearchTree <>();
93- List <Character > expected = Collections .unmodifiableList (
94- Arrays .asList ('4' , '2' , '6' , '1' , '3' , '5' , '7' )
95- );
90+ List <Character > expected = List .of ('4' , '2' , '6' , '1' , '3' , '5' , '7' );
9691
97- List <Character > treeData = Collections .unmodifiableList (
98- Arrays .asList ('4' , '2' , '6' , '1' , '3' , '5' , '7' )
99- );
92+ List <Character > treeData = List .of ('4' , '2' , '6' , '1' , '3' , '5' , '7' );
10093 treeData .forEach (binarySearchTree ::insert );
10194
102- List <Character > actual = binarySearchTree .getAsLevelOrderList ();
103- assertEquals (expected , actual );
95+ assertThat (binarySearchTree .getAsLevelOrderList ()).isEqualTo (expected );
10496 }
10597
10698 @ Ignore ("Remove to run test" )
10799 @ Test
108100 public void sortsSingleElement () {
109101 BinarySearchTree <String > binarySearchTree = new BinarySearchTree <>();
110- List <String > expected = Collections .unmodifiableList (
111- Collections .singletonList ("2" )
112- );
102+ List <String > expected = Collections .singletonList ("2" );
113103
114104 binarySearchTree .insert ("2" );
115105
116- List <String > actual = binarySearchTree .getAsSortedList ();
117- assertEquals (expected , actual );
106+ assertThat (binarySearchTree .getAsSortedList ()).isEqualTo (expected );
118107 }
119108
120109 @ Ignore ("Remove to run test" )
121110 @ Test
122111 public void sortsCollectionOfTwoIfSecondInsertedIsSmallerThanFirst () {
123112 BinarySearchTree <Integer > binarySearchTree = new BinarySearchTree <>();
124- List <Integer > expected = Collections .unmodifiableList (
125- Arrays .asList (1 , 2 )
126- );
113+ List <Integer > expected = List .of (1 , 2 );
127114
128115 binarySearchTree .insert (2 );
129116 binarySearchTree .insert (1 );
130117
131- List <Integer > actual = binarySearchTree .getAsSortedList ();
132- assertEquals (expected , actual );
118+ assertThat (binarySearchTree .getAsSortedList ()).isEqualTo (expected );
133119 }
134120
135121 @ Ignore ("Remove to run test" )
136122 @ Test
137123 public void sortsCollectionOfTwoIfSecondNumberisSameAsFirst () {
138124 BinarySearchTree <Character > binarySearchTree = new BinarySearchTree <>();
139- List <Character > expected = Collections .unmodifiableList (
140- Arrays .asList ('2' , '2' )
141- );
125+ List <Character > expected = List .of ('2' , '2' );
142126
143127 binarySearchTree .insert ('2' );
144128 binarySearchTree .insert ('2' );
145129
146- List <Character > actual = binarySearchTree .getAsSortedList ();
147- assertEquals (expected , actual );
130+ assertThat (binarySearchTree .getAsSortedList ()).isEqualTo (expected );
148131 }
149132
150133 @ Ignore ("Remove to run test" )
151134 @ Test
152135 public void sortsCollectionOfTwoIfSecondInsertedIsBiggerThanFirst () {
153136 BinarySearchTree <Character > binarySearchTree = new BinarySearchTree <>();
154- List <Character > expected = Collections .unmodifiableList (
155- Arrays .asList ('2' , '3' )
156- );
137+ List <Character > expected = List .of ('2' , '3' );
157138
158139 binarySearchTree .insert ('2' );
159140 binarySearchTree .insert ('3' );
160141
161- List <Character > actual = binarySearchTree .getAsSortedList ();
162- assertEquals (expected , actual );
142+ assertThat (binarySearchTree .getAsSortedList ()).isEqualTo (expected );
163143 }
164144
165145 @ Ignore ("Remove to run test" )
166146 @ Test
167147 public void iteratesOverComplexTree () {
168148 BinarySearchTree <String > binarySearchTree = new BinarySearchTree <>();
169- List <String > expected = Collections .unmodifiableList (
170- Arrays .asList ("1" , "2" , "3" , "5" , "6" , "7" )
171- );
149+ List <String > expected = List .of ("1" , "2" , "3" , "5" , "6" , "7" );
172150
173- List <String > treeData = Collections .unmodifiableList (
174- Arrays .asList ("2" , "1" , "3" , "6" , "7" , "5" )
175- );
151+ List <String > treeData = List .of ("2" , "1" , "3" , "6" , "7" , "5" );
176152 treeData .forEach (binarySearchTree ::insert );
177153
178- List <String > actual = binarySearchTree .getAsSortedList ();
179- assertEquals (expected , actual );
154+ assertThat (binarySearchTree .getAsSortedList ()).isEqualTo (expected );
180155 }
181156}
0 commit comments