【23】二叉树的层序遍历

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> ansList = new ArrayList<List<Integer>>();
        Queue<TreeNode> queue =new LinkedList<TreeNode>();
         if(root == null) return ansList;//如果树为空，直接返回同类型的空值
         //queue.offer
         queue.offer(root);//offer和add方法作用相同，都是往队列尾部插入元素，但是offer直接返回false，add会报出异常。
         while(!queue.isEmpty()){
             int n = queue.size();
             List<Integer> list = new ArrayList<Integer>();
             for(int i = 0;i < n;i++){
                 TreeNode cnode = queue.poll();
                 list.add(cnode.val);//每一个list把每一层的节点加入。
                 if(cnode.left!=null) queue.offer(cnode.left);
                 if(cnode.right!=null) queue.offer(cnode.right); 
             }
             ansList.add(list);
         }
         return ansList;
    }
}