LeetCode 102:二叉树的层次遍历(java)
题目:
解答:
/**
* 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<>();
Queue<Queue<TreeNode>> queue=new LinkedList<>();
TreeNode nodeTemp=root;
Queue<TreeNode> nodeQueue=new LinkedList<>();
nodeQueue.add(root);
queue.add(nodeQueue);
if(root==null)
return res;
while(!queue.isEmpty()){
nodeQueue=queue.poll();
Queue<TreeNode> queueTemp=new LinkedList<>();
List<Integer> list=new ArrayList<>();
while(!nodeQueue.isEmpty()){
nodeTemp=nodeQueue.poll();
list.add(nodeTemp.val);
if(nodeTemp.left!=null)
queueTemp.add(nodeTemp.left);
if(nodeTemp.right!=null)
queueTemp.add(nodeTemp.right);
}
if(!queueTemp.isEmpty())
queue.add(queueTemp);
if(!list.isEmpty())
res.add(list);
}
return res;
}
}