[Leetcode] maximum depth of N-ary Tree n maximum depth of the decision tree

 

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, given3-aryTree:

 

 

We shoshould return its max depth, which is 3.

 

Note:

1. The depth of the tree is at most1000.
2. The total number of nodes is at most5000.

 

S

 

[Leetcode] maximum depth of N-ary Tree n maximum depth of the decision tree