Leetcode学习笔记：#559. Maximum Depth of N-ary Tree

Leetcode学习笔记：#559. Maximum Depth of N-ary Tree

Given a n-ary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

实现：

public int maxDepth(Node root){
	if(root == null){
		return 0;
	}
	Queue<Node> queue = new LinkedList<>();
	queue.offer(root);

	int depth = 0;
	
	while(!queue.isEmpty()){
		int size = queue.size();
		for(int i = 0; i < size; i++){
			Node current = queue.poll();
			for(Node child : current.children)
				queue.offer(child);
		}
		depth++;
	}
	return depth;
}

思路：
用队列实现，先把根节点offer进队列，每到一层就把根节点推出，把该节点的子节点全部offer进队列，再把depth+1。