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.
思路:本题用BSF遍历这个二叉树，并将每一层放进一个stack中，再pop完stack就得到所需的结果
189
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
