Maximum Depth of N-ary Tree

class Solution:
    def maxDepth(self, root: 'Node') -> int:
        if not root:
            return 0
        if not root.children:
            return 1
        return 1 + max(self.maxDepth(child) for child in root.children)

/* 
// 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) {
            return 0;
        }

        int childDepth = 0;
        for (Node* child : root->children) {
            childDepth = max(childDepth, maxDepth(child));
        }
        return 1 + childDepth;
    }
};

function maxDepth(root: _Node | null): number {
    if (!root) {
        return 0;
    }

    let childDepth = 0;
    for (const child of root.children) {
        childDepth = Math.max(childDepth, maxDepth(child));
    }
    return 1 + childDepth;
}