LeetCode #559 Maximum Depth of N-ary Tree

Easy

Problem

Given a n-ary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

For example, given a 3-ary tree:

We should return its max depth, which is 3.

Note:

1. The depth of the tree is at most 1000.
2. The total number of nodes is at most 5000.

Solution

The idea is the same with #104.

Complexity

Complexity analytics are the same with #104 whose time complexity is O(n) if n denotes to count of nodes in this tree and space complexity is O(h) (or O(logn)) if h denotes to length of the deepest path.