Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

easy· trees Mock interview

Maximum Depth of a Binary Tree

Given the root of a binary tree, return its maximum depth: the number of nodes along the longest path from the root down to the farthest leaf. An empty tree has depth 0.

Examples

in: root = [3,9,20,null,null,15,7]

out: 3

3 -> 20 -> 15

in: root = []

out: 0

empty tree

Constraints

0 <= number of nodes <= 10^4
-100 <= node value <= 100

Hints

target: O(n) time⌘↩ run · ⇧⌘↩ submit