问题描述
- 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:
- 地址
问题分析
代码实现
public List<List<Integer>> levelOrderBottom(TreeNode root) {
if (root == null) {
return new ArrayList<>();
}
LinkedList<TreeNode> queue = new LinkedList<>();
List<List<Integer>> res = new ArrayList<>();
queue.add(root);
while (! queue.isEmpty()) {
int levelSize = queue.size();
List<Integer> levelList = new ArrayList<>();
for (int i = 0; i < levelSize; i++) {
TreeNode popNode = queue.remove();
levelList.add(popNode.val);
if (popNode.left != null) {
queue.add(popNode.left);
}
if (popNode.right != null) {
queue.add(popNode.right);
}
}
res.add(0, levelList);
}
return res;
}
public List<List<Integer>> levelOrderBottom(TreeNode root) {
if (root == null) {
return new ArrayList<>();
}
LinkedList<List<Integer>> res = new LinkedList<List<Integer>>();
dfs(root, 0, res);
return res;
}
public void dfs(TreeNode root, int level, LinkedList<List<Integer>> res) {
if (root == null) {
return;
}
if (res.size() < level + 1) {
res.addFirst(new ArrayList<>());
}
res.get(res.size() - level - 1).add(root.val);
dfs(root.left, level + 1, res);
dfs(root.right, level + 1, res);
}