LeetCode - Binary Tree Level Order Traversal II
2015-04-26 21:38
274 查看
把上一个类似的题目中的list反转就可以了。
/** * Definition for binary tree * 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>> list = new ArrayList<>(); List<List<Integer>> trlist = new ArrayList<>(); bfs(0, root, list); for(int i=list.size()-1; i>=0; i--) { trlist.add(list.get(i)); } return trlist; } public void bfs(int pos, TreeNode root, List<List<Integer>> list) { if(root==null) return; if(list.size() > pos) { list.get(pos).add(root.val); } else { List<Integer> l = new ArrayList<>(); l.add(root.val); list.add(l); } bfs(pos+1, root.left, list); bfs(pos+1, root.right, list); } }
相关文章推荐
- [leetcode]Binary Tree Level Order Traversal II
- Leetcode 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[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 c++】107 Binary Tree Level Order Traversal II
- 【leetcode刷题笔记】Binary Tree Level Order Traversal II
- LeetCode刷题(C++)——Binary Tree Level Order Traversal II(Easy)
- LeetCode 107: Binary Tree Level Order Traversal II
- [Leetcode 102 and 107, Easy] Binary Tree Level Order Traversal (I and II)
- LeetCode 107 Binary Tree Level Order Traversal II题解
- leetcode_107题——Binary Tree Level Order Traversal II (二叉树,广度优先搜索,队列,栈)
- Java [Leetcode 107]Binary Tree Level Order Traversal II
- LeetCode[Tree]: Binary Tree Level Order Traversal II
- LeetCode | Binary Tree Level Order Traversal I,II
- LeetCode - Binary Tree Level Order Traversal II