380. Maximum Depth of a Binary Tree
EasyDFS
Print the number of nodes on the longest path from the root down to a leaf.
Input format
Line 1: n (number of level-order entries) Line 2: the values in level order, -1 for a missing child
Output format
The depth.
Example 1
Input
7 3 9 20 -1 -1 15 7
Output
3
Example 2
Input
3 1 -1 2
Output
2
Constraints
1 ≤ nodes ≤ 10⁴
Read input from standard input and print the answer to standard output. Your code is judged against 5 test cases, most of them hidden.
Loading the MyLoginn IDE…