Merge pull request #103 from RepNazar/main

More complicated test case for BST depth() method test

Author: tboychuk

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

@@ -260,7 +260,19 @@ public static Stream<Arguments> depthArguments() {
                  * .........\
                  * ..........5
                  */
-                arguments(new Integer[]{1, 2, 3, 4, 5}, 4));
+                arguments(new Integer[]{1, 2, 3, 4, 5}, 4),
+                /*
+                 * .........6
+                 * ....../.....\
+                 * .....2.......7
+                 * .../...\......\
+                 * ..1.....5......8
+                 * ......./........\
+                 * ......4..........9
+                 * ...../.............
+                 * ....3...............
+                 */
+                arguments(new Integer[]{6, 2, 7, 1, 5, 8, 4, 9, 3}, 4));
     }