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 <code>{3,9,20,#,#,15,7}</code>,
return its bottom-up level order traversal as:
本文转自mfrbuaa博客园博客,原文链接:http://www.cnblogs.com/mfrbuaa/p/5030669.html,如需转载请自行联系原作者