Merge pull request #115 from bobocode-projects/fix-linked_queue_and_stack_tests

Minor fix for tests, rename test for tree

Author: tboychuk

2-0-data-structures-and-algorithms/2-2-2-stack/src/test/java/com/bobocode/cs/StackTest.java

@@ -353,6 +353,8 @@ private Object newNode(int element) {
 
         if (constructor.getParameters().length == 1) {
             return constructor.newInstance(element);
+        } else if (constructor.getParameters().length == 2) {
+            return constructor.newInstance(element, null);
         } else {
             Object node = constructor.newInstance();
             getNodeElementField(node).set(node, element);

2-0-data-structures-and-algorithms/2-2-3-linked-queue/src/test/java/com/bobocode/cs/LinkedQueueTest.java

@@ -164,13 +164,19 @@ void pollMakesSizeZeroWhenQueueHasSingleElement() {
     }
 
     @Test
+    @SneakyThrows
     @Order(11)
     void pollMakesQueueEmptyWhenQueueHasSingleElement() {
         addIntElementToQueue(1);
         this.integerQueue.poll();
         boolean isEmpty = isEmptyQueue();
 
+        Object tail = getAccessibleFieldByPredicate(integerQueue, TAIL_FIELD).get(integerQueue);
+        Object head = getAccessibleFieldByPredicate(integerQueue, HEAD_FIELD).get(integerQueue);
+
         assertThat(isEmpty).isEqualTo(true);
+        assertThat(tail).isNull();
+        assertThat(head).isNull();
     }
 
     @Test

2-0-data-structures-and-algorithms/2-2-6-binary-search-tree/src/test/java/com/bobocode/cs/BinarySearchTreeTest.java renamed to 2-0-data-structures-and-algorithms/2-2-6-binary-search-tree/src/test/java/com/bobocode/cs/RecursiveBinarySearchTreeTest.java

@@ -21,7 +21,7 @@
 import static org.junit.jupiter.params.provider.Arguments.arguments;
 
 @TestMethodOrder(MethodOrderer.OrderAnnotation.class)
-class BinarySearchTreeTest {
+class RecursiveBinarySearchTreeTest {
 
     private static final Predicate<Field> SIZE_FIELD = field -> field.getName().toLowerCase().contains("size")
             || field.getName().toLowerCase().contains("length");