leetcode - Binary Tree Level Order Traversal II

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，如需轉載請自行聯系原作者