# Maximum Depth Of N-Ary Tree Problem

## Description

LeetCode Problem 559.

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.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Example 1:

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

Example 2:

``````1
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
``````

Constraints:

• The total number of nodes is in the range [0, 10^4].
• The depth of the n-ary tree is less than or equal to 1000.

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;

Node() {}

Node(int _val) {
val = _val;
}

Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
*/

class Solution {
public:
int maxDepth(Node* root) {
if (root == NULL)
return 0;
int max_depth = 0;
for (int i = 0; i < root->children.size(); i ++) {
int d = maxDepth(root->children[i]);
if (d > max_depth)
max_depth = d;
}
return max_depth + 1;
}
};
``````