Maximum Depth of Binary Tree — Easy Coding Interview Question

Given the root of a binary tree, return its maximum depth (the number of nodes on the longest root-to-leaf path).

Example

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

Output: 3

Constraints

• 0 ≤ tree nodes ≤ 10⁴

Topics & Companies

Topics: trees, recursion

Asked by: Amazon, Google, Meta, Microsoft, Apple

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(h).

Practice more

• All DSA Problems
• DSA Patterns