Class Sanghoo

LeetCode/BFS/559. Maximum Depth of N-ary Tree/Sanghoo.java:24–50

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

 * https://leetcode.com/problems/maximum-depth-of-n-ary-tree/
 */
public class Sanghoo {

    public static int maxDepth(Node root) {
        if(root == null) return 0;

        int res = 0;
        Queue<Node> q = new LinkedList<>();

        q.offer(root);

        while (!q.isEmpty()) {
            int size = q.size();

            for(int i=0; i<size; i++) {
                Node node = q.poll();

                for(Node n : node.children) {
                    q.offer(n);
                }
            }
            res++;
        }

        return res;
    }

}