107|107 Binary Tree Level Order Traversal II
【107|107 Binary Tree Level Order Traversal II】title: Binary Tree Level Order Traversal II
tags:
- binary-tree-level-order-traversal-ii
- No.107
- simple
- tree
- breadth-first-search
- queue
Description
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,null,null,15,7]
,
3
/ \
920
/\
157
return its bottom-up level order traversal as:
[
[15,7],
[9,20],
[3]
]
Corner Cases
- empty root
Insert in head for the returned list. Use number counter to divide the layers. It's obvious that the running time is O(V) when the queue operations are all in O(1).
/**
* Definition for a binary tree node.
* public class TreeNode {
*int val;
*TreeNode left;
*TreeNode right;
*TreeNode(int x) { val = x;
}
* }
*/
class Solution {
public List> levelOrderBottom(TreeNode root) {
Queueque= new LinkedList();
List> llst = new LinkedList>();
if (root == null) {return llst;
}
que.offer(root);
int curr = 0;
int nlay = 1;
while (!que.isEmpty()) {
nlay = que.size();
curr = 0;
List a = new LinkedList();
while(curr < nlay) {
TreeNode x = que.poll();
if (x.left!= null) {que.offer(x.left);
}
if (x.right != null) {que.offer(x.right);
}
a.add(x.val);
curr = curr + 1;
}
llst.add(0, a);
}
return llst;
}
}
推荐阅读
- 葱爷说股20190107
- 感恩日志20181107
- 怀念三里屯那家叫做the|怀念三里屯那家叫做the tree 的酒吧
- 【0107读书清单】|【0107读书清单】 战胜懒惰,拖延症就治愈了一半
- ztree|ztree 拖拽
- SourceTree|SourceTree 教程文档(了解界面)
- cs61b week8 -- Binary Search Tree
- UVA 10763
- webpack总结
- Codeforces|Codeforces Round #263 Div.1 B Appleman and Tree --树形DP【转】