Maximum Depth of Binary Tree

Problem

Find the maximum root-to-leaf depth of a binary tree represented as a level-order array with nulls.

Examples

Example 1

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

Output: 3

Example 2

Input: [1]

Output: 1

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Maximum Depth of Binary Tree

Find the maximum root-to-leaf depth of a binary tree represented as a level-order array with nulls. Traverse child indices 2i+1 and 2i+2. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n) time and O(n) queue space.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.