leetcode 102. Binary Tree Level Order Traversal(层次遍历)

---

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

 

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

思路：

使用两个队列。巩固一下队列和层次遍历。

代码：

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        if(root == null)return lists;
        Queue<TreeNode> q=new LinkedList<TreeNode>();
        TreeNode cur = root;
        q.offer(cur);
        while(!q.isEmpty()){
            Queue<TreeNode> qt = new LinkedList<TreeNode>();
            List<Integer> list = new ArrayList<Integer>();
            while(!q.isEmpty()){
                TreeNode temp = q.poll();
                list.add(temp.val);
                if(temp.left != null) qt.offer(temp.left);
                if(temp.right!= null) qt.offer(temp.right);
            }
            lists.add(list);
            q=qt;
        }
        return lists;
    }
}