Search⌘ K
AI Features
Home
Courses
Learn Data Structures and Algorithms

Problem: Maximum Depth of Binary Tree

Explore how to compute the maximum depth of a binary tree by using recursion and depth-first search (DFS). Understand the step-by-step recursive process that examines each node and returns the longest path from root to a leaf. This lesson helps you implement an efficient algorithm to measure tree depth with linear time complexity and analyze its space usage.

We'll cover the following...

Statement

Given the root of a binary tree, return its maximum depth.

The maximum depth of a binary tree is defined as the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf node is a node with no children.

Constraints:

  • The number of nodes in the tree is in the range [0,104][0, 10^4].

  • −100≤-100 \leq ...