Leetcode: 107. Binary Tree Level Order Traversal II(JAVA)

最新推荐文章于 2021-02-03 11:47:46 发布

那莫名

最新推荐文章于 2021-02-03 11:47:46 发布

阅读量353

点赞数

分类专栏： Leetcode 文章标签： leetcode java

本文链接：https://blog.csdn.net/u010183658/article/details/50838246

版权

Leetcode 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

【问题描述】

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree {3,9,20,#,#,15,7},

return its bottom-up level order traversal as:

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

【思路】

设置一个队列，存储当前层的node，按层循环，依次存储下一层节点进入queue队列，并且存储当前node.val到currentList中，每次把当前层的val存储到resultList最前面。

【代码】

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> levelOrderBottom(TreeNode root) {
        List<List<Integer>> result = new LinkedList<List<Integer>>();
		Queue<TreeNode> currentLevel = new LinkedList<TreeNode>();

		if (root == null) {
			return result;
		}
		currentLevel.offer(root);
		while (!currentLevel.isEmpty()) {
			List<Integer> levelList = new LinkedList<Integer>();
			int size = currentLevel.size();

			for (int i = 0; i < size; i++) {
				TreeNode currentNode = currentLevel.poll();
				if (currentNode.left != null) {
					currentLevel.offer(currentNode.left);
				}
				if (currentNode.right != null) {
					currentLevel.offer(currentNode.right);
				}
				levelList.add(currentNode.val);
			}
			result.add(0, levelList);
		}
		return result;
    }
}