559. Maximum Depth of N-ary Tree.cpp

/*
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
public:
    int maxDepth(Node* root) {
        if(root == NULL){
            return 0;
        }
        else{
            int depth = 0;
            for(int i=0;i<root->children.size();i++){
                depth = max(depth,maxDepth(root->children[i]));
            }
            return 1+depth;
        }
    }
};