二叉树的层序遍历

二叉树的层序遍历

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