LeetCode——Binary Tree Level Order Traversal II
2014-07-14 11:07
246 查看
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
return its bottom-up level order traversal as:
原题链接:https://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/
题目:给定一个二叉树,从底到顶返回节点的层序遍历的值。(如,从左到右,一层一层)
思路:上一题的结果上面逆转一下即可。完全不用出这题吧?
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
if (root == null)
return list;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while (!queue.isEmpty()) {
List<Integer> li = new ArrayList<Integer>();
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode node = queue.poll();
li.add(node.val);
if (node.left != null)
queue.add(node.left);
if (node.right != null)
queue.add(node.right);
}
list.add(li);
}
List<List<Integer>> ret = new ArrayList<List<Integer>>();
for (int i = list.size() - 1; i >= 0; i--) {
ret.add(list.get(i));
}
return ret;
}
// Definition for binary tree
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
For example:
Given binary tree
{3,9,20,#,#,15,7},
3 / \ 9 20 / \ 15 7
return its bottom-up level order traversal as:
[ [15,7], [9,20], [3] ]
原题链接:https://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/
题目:给定一个二叉树,从底到顶返回节点的层序遍历的值。(如,从左到右,一层一层)
思路:上一题的结果上面逆转一下即可。完全不用出这题吧?
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> list = new ArrayList<List<Integer>>();
if (root == null)
return list;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
while (!queue.isEmpty()) {
List<Integer> li = new ArrayList<Integer>();
int size = queue.size();
for (int i = 0; i < size; i++) {
TreeNode node = queue.poll();
li.add(node.val);
if (node.left != null)
queue.add(node.left);
if (node.right != null)
queue.add(node.right);
}
list.add(li);
}
List<List<Integer>> ret = new ArrayList<List<Integer>>();
for (int i = list.size() - 1; i >= 0; i--) {
ret.add(list.get(i));
}
return ret;
}
// Definition for binary tree
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
相关文章推荐
- leetcode之Binary Tree Level Order Traversal II
- [leetcode]Binary Tree Level Order Traversal II
- [LeetCode13]Binary Tree Level Order Traversal II
- leetcode_107_Binary Tree Level Order Traversal II
- LeetCode Binary Tree Level Order Traversal II
- ( Leetcode 107 ) Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- [leetcode刷题系列]Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- leetcode--BinaryTreeLevelOrderTraversal II (二叉树层遍历递归实现)
- LeetCode107——Binary Tree Level Order Traversal II
- LeetCode: Binary Tree Level Order Traversal II
- LeetCode 之 Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal II (leetcode)
- LeetCode 107: Binary Tree Level Order Traversal II
- 【Leetcode】Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal II--LeetCode
- Leetcode: Binary Tree Level Order Traversal II
- 【LeetCode-面试算法经典-Java实现】【107-Binary Tree Level Order Traversal II(二叉树层序遍历II)】
- [leetcode]_Binary Tree Level Order Traversal I && II