您的位置:首页 > 其它

LeetCode Binary Tree Level Order Traversal II

2012-11-15 11:14 489 查看
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 
{3,9,20,#,#,15,7}
,

3
/ \
9  20
/  \
15   7


return its bottom-up level order traversal as:

[
[15,7]
[9,20],
[3],
]


Solution:

Reverse the result of Binary Tree Level Order Traversal.

LeetCode Binary Tree Level Order Traversal
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: