【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,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

二、问题分析

二叉树的层次遍历。需要队列来辅助，同时为了明确是哪层，需要设置两个变量来计数，一个统计当前层，一个统计下一层。

三、Java AC代码

public List<List<Integer>> levelOrder(TreeNode root) {
        LinkedList<List<Integer>> list = new LinkedList<List<Integer>>();
		if (root==null) {
			return list;
		}
		LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
		LinkedList<Integer> listItem = new LinkedList<Integer>();
		queue.add(root);
		int curLevelItemNums = 1;
		int nextLevelItemNums = 0;
		while(!queue.isEmpty()){
			TreeNode node = queue.poll();
			TreeNode leftNode = node.left;
			TreeNode rightNode = node.right;
			curLevelItemNums--;
			listItem.add(node.val);
			if (leftNode!=null) {
				queue.add(leftNode);
				nextLevelItemNums++;
			}
			if (rightNode!=null) {
				queue.add(rightNode);
				nextLevelItemNums++;
			}
			if (curLevelItemNums == 0) {
				curLevelItemNums = nextLevelItemNums;
				nextLevelItemNums = 0;
				list.add(listItem);
				listItem = new LinkedList<Integer>();
			}
		}
		return list;
	}