2017年3月9日
[leetcode tree]107. 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 阅读全文
posted @ 2017-03-09 22:47 wilderness 阅读(134) 评论(0) 推荐(0)
[leetcode tree]104. Maximum Depth of Binary Tree
摘要： 求树的最大深度 1 line python 阅读全文
posted @ 2017-03-09 11:57 wilderness 阅读(108) 评论(0) 推荐(0)
[leetcode tree]103. Binary Tree Zigzag Level Order Traversal
摘要： Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and 阅读全文
posted @ 2017-03-09 11:48 wilderness 阅读(117) 评论(0) 推荐(0)