【LeetCode】 107. Binary Tree Level Order Traversal II 二叉树的层次遍历 II(Easy)(JAVA)
题目地址: https://leetcode.com/problems/binary-tree-level-order-traversal-ii/
题目描述:
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,null,null,15,7],
3
/ \
9 20
/ \
15 7
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]
题目大意
给定一个二叉树,返回其节点值自底向上的层次遍历。 (即按从叶子节点所在层到根节点所在的层,逐层从左向右遍历)
解题方法
和 I 中的题目一样,只是加入顺序不同而已
【LeetCode】 102. Binary Tree Level Order Traversal 二叉树的层序遍历(Medium)(JAVA)
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if (root == null) return res;
List<Integer> list = new ArrayList<>();
List<TreeNode> nodes = new ArrayList<>();
nodes.add(root);
int count = 1;
while (nodes.size() > 0) {
TreeNode node = nodes.remove(0);
count--;
list.add(node.val);
if (node.left != null) nodes.add(node.left);
if (node.right != null) nodes.add(node.right);
if (count == 0) {
count = nodes.size();
res.add(0, new ArrayList<>(list));
list = new ArrayList<>();
}
}
return res;
}
}
执行用时 : 2 ms, 在所有 Java 提交中击败了 35.35% 的用户
内存消耗 : 39.9 MB, 在所有 Java 提交中击败了 7.41% 的用户