max_depth_n_arry_Tree.cpp

/*
// 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 height=1;
        for(auto it: root->children) {
            int h=maxDepth(it)+1;
            height = max(height, h);
        }
        return height;
    }
};