559. Maximum Depth of N-ary Tree

leetcode.com/problems/maximum-depth-of-n-ary-tree/

Maximum Depth of N-ary Tree - LeetCode

class Solution {
    
    public int maxDepth(Node root) {
		if(root == null) return 0;
        Queue<Node> q = new LinkedList<>();
        q.offer(root);
        
        int depth = 0;
        
        while(!q.isEmpty()) {
            depth++;
            int size = q.size();
            for(int i=0; i<size; i++) {
                Node node = q.poll();
                for(Node child : node.children) {
                    q.offer(child);
                }
            }
        }
        return depth;
	}
    /*
    public int maxDepth(Node root) {
		if (root == null) return 0;
		int max = 0;
		for(Node n : root.children) {
			int temp = maxDepth(n);
			if(temp > max) max = temp;
		}
		return max + 1;
	}
    */
}