Given a binary tree, find its maximum depth.
The maximum depth is thenumberof nodes along the longest path fromthe root node down tothe farthest leaf node.
Note: A leaf is a node with no children.
Given binary tree [3,9,20,null,null,15,7],
157return its depth = 3.
39 / 39 test cases passed.
Submitted:0 minutes ago
You are here!
Your runtime beats 100.00 % of java submissions.