50.N叉树的层序遍历

 

class Solution {
    public List<List<Integer>> levelOrder(Node root) {
        List<List<Integer>> res=new ArrayList<>();
        if(root==null){
            return res;
        }
        Deque<Node> qu=new LinkedList<>();
        qu.offer(root);
        int le;
        Node nod;
        while(!qu.isEmpty()){
            le=qu.size();
            List<Integer> li=new ArrayList<>();
            while(le>0){
                nod=qu.poll();
                li.add(nod.val);
                if(nod!=null){
                    for(Node i:nod.children){
                        qu.offer(i);
                    }
                }
                le--;
            }
            res.add(li);
        }
        return res;
    }
}

class Solution(object):
    def levelOrder(self, root):
        res=[]
        if root is None:
            return res
        qu=collections.deque()
        qu.append(root)
        while qu:
            le=len(qu)
            li=[]
            while le>0:
                nod=qu.popleft()
                li.append(nod.val)
                if nod:
                    for i in nod.children:
                        qu.append(i)
                le-=1
            res.append(li)
        return res