102. 二叉树的层次遍历

/**
 * 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>> res = new ArrayList<>();
        if (root == null) return res;
        Queue<TreeNode> q = new LinkedList<>();
        q.add(root);
        while (!q.isEmpty()) {
            Integer size = q.size();
            List<Integer> list = new ArrayList<>();
            for (int i = 0; i < size; i++) {
                TreeNode treeNode = q.poll();
                list.add(treeNode.val);
                if (treeNode.left != null)
                    q.add(treeNode.left);
                if (treeNode.right != null)
                    q.add(treeNode.right);
            }
            res.add(list);
        }
        return res;
    }
}

注：

层序遍历，最通用的方法是递归。但是用queue进行BFS也需要会，一般面试时都会问到。