Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit e4144be

Browse files
committed
More complicated test case for BST depth() method test
1 parent dc38580 commit e4144be

File tree

1 file changed

+13
-1
lines changed

1 file changed

+13
-1
lines changed

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

Lines changed: 13 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -260,7 +260,19 @@ public static Stream<Arguments> depthArguments() {
260260
* .........\
261261
* ..........5
262262
*/
263-
arguments(new Integer[]{1, 2, 3, 4, 5}, 4));
263+
arguments(new Integer[]{1, 2, 3, 4, 5}, 4),
264+
/*
265+
* .........6
266+
* ....../.....\
267+
* .....2.......7
268+
* .../...\......\
269+
* ..1.....5......8
270+
* ......./........\
271+
* ......4..........9
272+
* ...../.............
273+
* ....3...............
274+
*/
275+
arguments(new Integer[]{6, 2, 7, 1, 5, 8, 4, 9, 3}, 4));
264276
}
265277

266278

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /