LeetCode 102—二叉树的层次遍历

	// 递归
	public List<List<Integer>> levelOrder(TreeNode root) {
		if (root == null) {
			return null;
		}
		List<List<Integer>> result = new ArrayList<>();
		Queue<TreeNode> queue = new LinkedList<>();
		queue.offer(root);
		while (!queue.isEmpty()) {
			List<Integer> oneLevel = new ArrayList<>();
			for (int i = queue.size(); i > 0; --i) {
				TreeNode t = queue.poll();
				oneLevel.add(t.val);
				if (t.left != null)
					queue.offer(t.left);
				if (t.right != null)
					queue.offer(t.right);

			}
			result.add(oneLevel);
		}
		return result;
	}

	

 

// 迭代
	public List<List<Integer>> levelOrder1(TreeNode root) {
		List<List<Integer>> result = new ArrayList<>();
		levelorder(root, 0, result);
		return result;

	}

	public void levelorder(TreeNode node, int level, List<List<Integer>> result) {
		if (node == null)
			return;
		if (result.size() == level)
			result.add(null);
		result.get(level).add(node.val);
		if (node.left != null)
			levelorder(node.left, level + 1, result);
		if (node.right != null)
			levelorder(node.right, level + 1, result);

	}