2015年7月23日
103 Binary Tree Zigzag Level Order Traversal
摘要： 103 Binary Tree Zigzag Level Order Traversallevel traversal的变种class Solution: # @param {TreeNode} root # @return {integer[][]} def zigzagLeve... 阅读全文
posted @ 2015-07-23 02:38 dapanshe 阅读(127) 评论(0) 推荐(0)
108 Convert Sorted Array to Binary Search Tree
摘要： 108 Convert Sorted Array to Binary Search Tree递归解法还是非常直观的class Solution: # @param {integer[]} nums # @return {TreeNode} def sortedArrayToBST(... 阅读全文
posted @ 2015-07-23 02:29 dapanshe 阅读(96) 评论(0) 推荐(0)
117 Populating Next Right Pointers in Each Node II
摘要： 117 Populating Next Right Pointers in Each Node II就是 Bibary Tree Level order Traverseclass Solution: # @param root, a tree link node # @return n... 阅读全文
posted @ 2015-07-23 01:45 dapanshe 阅读(136) 评论(0) 推荐(0)
102 Binary Tree Level Order Traversal
摘要： 102 Binary Tree Level Order Traversalclass Solution: # @param {TreeNode} root # @return {integer[][]} def levelOrder(self, root): if r... 阅读全文
posted @ 2015-07-23 01:26 dapanshe 阅读(120) 评论(0) 推荐(0)