leetcode-二叉树的层次遍历

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> retlist = new LinkedList<>();
        Queue<TreeNode> nodequeue = new LinkedList<>();
        if(root==null){
            return retlist;
        }
        nodequeue.add(root);
        while(nodequeue.size()>0){
            //全部弄出来
            Queue<TreeNode> newqueue = new LinkedList<>();
            List<Integer> levelist = new LinkedList<>();
            while(nodequeue.size()>0){
                TreeNode nownode = nodequeue.poll();
                levelist.add(nownode.val);
                if(nownode.left!=null){
                    newqueue.add(nownode.left);
                }
                if(nownode.right!=null){
                    newqueue.add(nownode.right);
                }
            }
            retlist.add(levelist);
            nodequeue=newqueue;
        }
        return retlist;


    }
}

解题思路:

    这道题需要将二叉树的每一层节点装入一个list。显然我们应该想到使用队列。每一层的遍历都要将queue中所有treeNode取出，装入一个新list,然后再用一个新queue装入这些treeNode的左右子树。循环往复，即可。