CODE 31: Binary Tree Level Order Traversal
来源:互联网 发布:淘宝怎么养号快 编辑:程序博客网 时间:2024/06/10 05:28
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For example:
Given binary tree {3,9,20,#,#,15,7}
,
3 / \ 9 20 / \ 15 7
return its level order traversal as:
[ [3], [9,20], [15,7]]
confused what "{1,#,2,3}"
means? > read more on how binary tree is serialized on OJ.
OJ's Binary Tree Serialization:
The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
Here's an example:
1 / \ 2 3 / 4 \ 5The above binary tree is serialized as
"{1,2,3,#,#,4,#,#,5}"
.public ArrayList<ArrayList<Integer>> levelOrder(TreeNode root) {// Start typing your Java solution below// DO NOT write main() functionif (null == root) {return new ArrayList<ArrayList<Integer>>();}ArrayList<ArrayList<Integer>> results = new ArrayList<ArrayList<Integer>>();Queue<TreeNode> queue = new LinkedList<TreeNode>();ArrayList<Integer> layerVals = new ArrayList<Integer>();queue.offer(root);int layerNumber = 1;while (!queue.isEmpty()) {TreeNode node = queue.poll();layerVals.add(node.val);layerNumber--;if (null != node.left) {queue.offer(node.left);}if (null != node.right) {queue.offer(node.right);}if (layerNumber == 0) {layerNumber = queue.size();ArrayList<Integer> layerValsCpy = new ArrayList<Integer>();layerValsCpy.addAll(layerVals);results.add(layerValsCpy);layerVals.clear();}}return results;}
- CODE 31: Binary Tree Level Order Traversal
- [leet code] Binary Tree Level Order Traversal
- binary-tree-level-order-traversal Java code
- binary-tree-level-order-traversal Java code
- CODE 30: Binary Tree Zigzag Level Order Traversal
- CODE 26: Binary Tree Level Order Traversal II
- [leet code] Binary Tree Level Order Traversal II
- [leet code] Binary Tree Zigzag Level Order Traversal
- leet code Binary Tree Zigzag Level Order Traversal
- leetcode 日经贴,Cpp code -Binary Tree Level Order Traversal
- leetcode 日经贴,Cpp code -Binary Tree Zigzag Level Order Traversal
- leetcode 日经贴,Cpp code -Binary Tree Level Order Traversal II
- Leet Code 103. Binary Tree Zigzag Level Order Traversal 题解
- binary-tree-zigzag-level-order-traversal Java code
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- 配置tomcat以指定的身份运行(Linux平台)
- CODE 30: Binary Tree Zigzag Level Order Traversal
- iOS 5 ARC 入门 (1/3)
- User has no SELECT privilege on V$SESSION
- iOS 5 ARC 入门 (2/3)
- CODE 31: Binary Tree Level Order Traversal
- 区间dp-hdu-4745-Two Rabbits
- 如何终止 DIV 的 float 属性
- Mozilla Thunderbird如何设置开启密码
- poj1966Cable TV Network(无向图最小点割集 ISAP+邻接矩阵)
- android EditText取消自动获取焦点 改善用户体验
- HDU 2191 悼念512汶川大地震遇难同胞——珍惜现在,感恩生活 解题报告
- gcvt函数使用注意事项
- 堆排序