[LeetCode] 107. Binary Tree Level Order Traversal II 二叉树层序遍历之二

Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf
posted @ 2014-10-26 05:23  Grandyang  阅读(13933)  评论(1)  编辑  收藏  举报
Fork me on GitHub