We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 0f0a31d commit 2c0f859Copy full SHA for 2c0f859
solutions/minimumDepthOfBinaryTree.test.ts
@@ -5,7 +5,7 @@ describe("111. Minimum Depth of Binary Tree", () => {
5
const TEST_CASES = new Map([
6
[[3, 9, 20, null, null, 15, 7], 2],
7
[[1, 2], 2],
8
- [[1, 2, null, null, null, 2], 3],
+ [[1, null, 2, null, 2], 3],
9
[[1], 1],
10
[[], 0]
11
]);
0 commit comments