Search⌘ K
AI Features

Problem: Maximum Depth of Binary Tree

Explore how to compute the maximum depth of a binary tree by applying a recursive depth-first search method. This lesson guides you through the process of traversing each path to find the longest one from root to leaf while understanding the linear time complexity and worst-case space usage. You will gain practical skills to implement and analyze tree depth calculation in JavaScript.

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 ...