代码随想录——N叉树的最大深度（Leetcode559）

题目链接

层序遍历，广度优先

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

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    public int maxDepth(Node root) {  
        Deque<Node> queue = new LinkedList<Node>();
        int depth = 0;
         if(root == null){
           return depth;
        }
        queue.offer(root);
        while(!queue.isEmpty()){
            int size = queue.size();
            for(int i = 0; i < size; i++){
                Node node = queue.poll();
                // N叉树子节点入队方式
                List<Node> children = node.children;
                for(Node child : children){
                    queue.offer(child);
                }
            }
            depth++;
        }
        return depth;
    }
}