LeetCode: 剑指 Offer 32 - II. 从上到下打印二叉树 II
树的层序遍历. >> bfs
List<Integer> list = new ArrayList<>();
List<List<Integer>> ans = new ArrayList<>();
public List<List<Integer>> levelOrder(TreeNode root) {
if(root == null) return ans;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode node = ((LinkedList<TreeNode>) queue).pop();
list.add(node.val);
if(node.left != null)
queue.offer(node.left);
if(node.right != null)
queue.offer(node.right);
}
// 每一层 保存到 ans
ans.add(new ArrayList<>(list));
list.clear();
}
return ans;
}