Binary Tree Level Order Traversal II --- LeetCode
来源:互联网 发布:mysql有哪几种连接池 编辑:程序博客网 时间:2024/06/05 16:34
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}
,
3 / \ 9 20 / \ 15 7
return its bottom-up level order traversal as:
[ [15,7], [9,20], [3]]
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
/**
* 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>> traversal(Queue<TreeNode> queue,List<List<Integer>> rs){
List<Integer> list=new ArrayList<Integer>();
Queue<TreeNode> q=new LinkedList<TreeNode>();
while(!queue.isEmpty()){
TreeNode node=queue.poll();
if(node!=null){
list.add(node.val);
if(node.left!=null){
q.offer(node.left);
}
if(node.right!=null){
q.offer(node.right);
}
}
}
if(!q.isEmpty()){
rs=traversal(q,rs);
}
rs.add(list);
return rs;
}
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> rs=new ArrayList<List<Integer>>();
Queue<TreeNode> queue=new LinkedList<TreeNode>();
if(root==null){
return rs;
}
queue.offer(root);
rs=traversal(queue,rs);
return rs;
}
}
- LeetCode: 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 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]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] 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】Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- ExtJs控件属性配置详细
- 微信公众平台开发教程第20篇-新手解惑40则
- LeetCode OJ 之 Sort Colors(颜色排序)
- 3097-小鑫爱数学
- Java中static关键字的使用
- Binary Tree Level Order Traversal II --- LeetCode
- 删除控制面板里面的java
- java解惑之字符之谜(谜题15)
- 优化ViewController
- [IOS 开发] NSString-计算文本的宽度和高度
- vba 调用系统复制剪切功能
- logback demo
- 追逐自己的梦想----------辅助制作第七课:封装调试函数OutputDebugString(),使其可调试任意参数个数
- gradle学习(8)-gradle的命令行