2014年11月15日
[leetcode] 9. Binary Tree Level Order Traversal
摘要： 跟第七题一样，把最后的输出顺序换一下就行。。。Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For exampl... 阅读全文
posted @ 2014-11-15 20:59 Tiny-Box 阅读(123) 评论(0) 推荐(0)
[leetcode] 8. Maximum Depth of Binary Tree
摘要： 可能是因为我是按难度顺序刷的原因，这个其实在之前的几道题里面已经写过了。题目如下： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf nod... 阅读全文
posted @ 2014-11-15 20:53 Tiny-Box 阅读(104) 评论(0) 推荐(0)
[leetcode] 7. 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,... 阅读全文
posted @ 2014-11-15 00:44 Tiny-Box 阅读(104) 评论(0) 推荐(0)