层序遍历BFS2.N叉树

N叉树层序遍历

 import java.util.ArrayList;
 import java.util.LinkedList;
class Solution {
    public List<List<Integer>> levelOrder(Node root) {
         List<List<Integer>> res=new ArrayList<List<Integer>>();
        if(root==null)return res;
        Queue<Node> q=new LinkedList<Node>();
        q.offer(root);
        while(!q.isEmpty()){
            int size=q.size();
            List<Integer> list=new ArrayList<Integer>();
            for(int i=0;i<size;i++){
                Node node=q.poll();
                list.add(node.val);
                q.addAll(node.children);
            }
            res.add(list);
        }
        return res;
    }
}

N叉树最大深度

class Solution {
    public int maxDepth(Node root) {
        if(root==null)return 0;
        if(root.children.size()==0)return 1;
        int max=Integer.MIN_VALUE;
        for(Node n:root.children){
            max=Math.max(max,maxDepth(n));
        }
        return max+1;
    }
}