Problem 33 of 75

Maximum Depth of Binary Tree

EasyNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

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

[3,9,20,null,null,15,7] → 3

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Maximum Depth of Binary Tree, explainedNeetCode
GO DEEPER

The full interview treatment: the conversation, why the approach works, and step-by-step visuals.