Leetcode Binary Tree Level Order Traversal II 二叉树分层遍历
来源:互联网 发布:网络三国官网 编辑:程序博客网 时间:2024/05/16 19:04
题目:
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]]
分析:
和第一题目一样,只是需要在加入每层节点的时候都加在ArrayList的第一个。用下面这个函数:
public void add(int index, E element)
Inserts the specified element at the specified position in this list. Shifts the element currently at that position (if any) and any subsequent elements to the right (adds one to their indices).
Java代码实现:
/** * Definition for a binary tree node. * 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>> result = new ArrayList<List<Integer>>(); if(root==null) return result; Queue<TreeNode> q = new LinkedList<TreeNode>(); q.offer(root); while(!q.isEmpty()) { int size = q.size(); ArrayList<Integer> temp = new ArrayList<Integer>(); for(int i=0;i<size;i++) { TreeNode node = q.poll(); temp.add(node.val); if(node.left!=null) q.offer(node.left); if(node.right!=null) q.offer(node.right); } result.add(0, temp); } return result; }}
0 0
- Binary Tree Level Order Traversal 分层遍历二叉树@LeetCode
- Leetcode Binary Tree Level Order Traversal 二叉树分层遍历
- Leetcode Binary Tree Level Order Traversal II 二叉树分层遍历
- LeetCode 107. Binary Tree Level Order Traversal II(二叉树分层遍历)
- LeetCode 102. Binary Tree Level Order Traversal(二叉树分层遍历)
- Leetcode 103 ,Binary Tree Zigzag Level Order Traversal(二叉树Z形分层遍历)
- leetcode---binary-tree-level-order-traversal-ii---树层次遍历
- leetCode解题报告之Binary Tree Level Order Traversal II,I(二叉树层次遍历)
- LeetCode OJ 之 Binary Tree Level Order Traversal II (二叉树的层次遍历-二)
- 107.LeetCode Binary Tree Level Order Traversal II(easy)[二叉树层次遍历 广度搜索 队列]
- Leetcode 107. Binary Tree Level Order Traversal II 二叉树层次遍历2 解题报告
- Leetcode#107. Binary Tree Level Order Traversal II (queue二叉树层次遍历)
- 【LeetCode-面试算法经典-Java实现】【103-Binary Tree Zigzag Level Order Traversal(二叉树分层Z字形遍历)】
- LeetCode | Binary Tree Level Order Traversal II(二叉树层序遍历II)
- 【leetcode 层序遍历】Binary Tree Level Order Traversal II
- Binary Tree Level Order Traversal II 二叉树按层遍历(反向输出)@LeetCode
- 【LeetCode笔记】Binary Tree Level Order Traversal II 二叉树按层遍历,反向输出
- [LeetCode]107. Binary Tree Level Order Traversal II--二叉树层序遍历2
- JNI搭建:native方法注册或NDK中的方法对应
- web.py中关于url的总结
- ZendGuardLoader
- 短信验证码自动填充
- 【c语言】自己的strncpy与库里的strncpy区别
- Leetcode Binary Tree Level Order Traversal II 二叉树分层遍历
- 警告: 未提供 -tsa 或 -tsacert, 此 jar 没有时间戳。如果没有时间戳, 则在签名者证书的到期
- do{...}while(0)的意义和用法(转)
- afx_msg解释
- MySQL数据库自动备份
- Linux下ffmpeg添加 x265
- SSH常见面试题
- adb remount of system failed: Permission denied
- cocos2dx坐标转换