Easy

Quiz

#559 Maximum Depth of N-ary Tree

APPROACH

Given the root of an N-ary tree, return its maximum depth — the number of nodes on the longest downward path from the root to any leaf. The tree is serialized in level-order with null separating each node's children.

Example 1:

Input: root = [1,null,3,2,4,null,5,6]

Output: 3

Example 2:

Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]

Output: 5

1 of 4

1:00

What is the optimal approach for this problem?