102. Binary Tree Level Order Traversal
2017-09-29 11:27
211 查看
class Solution { public List<List<Integer>> levelOrder(TreeNode root) { List<List<Integer>> res=new ArrayList<List<Integer>>(); if(root==null) return res; Queue<TreeNode> queue=new LinkedList<TreeNode>(); queue.add(root); queue.add(null); List<Integer> list=new ArrayList<Integer>(); while(!queue.isEmpty()) { TreeNode node=queue.poll(); if(node==null) { res.add(new ArrayList<Integer>(list)); if(!queue.isEmpty()) queue.add(node); list.clear(); } else { list.add(node.val); if(node.left!=null) queue.add(node.left); if(node.right!=null) queue.add(node.right); } } return res; } }
相关文章推荐
- 102.Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal - Leetcode
- leecode 解题总结:102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal (java)
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal ------层序遍历
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal & 107. Binary Tree Level Order Traversal II & 103. Binary Tre
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- C++详解Leetcode:102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- 102. Binary Tree Level Order Traversal
- LeetCode笔记:102. Binary Tree Level Order Traversal
- Tree-----宽度优先遍历树(102. Binary Tree Level Order Traversal)