摘要：
103 Binary Tree Zigzag Level Order Traversallevel traversal的变种class Solution: # @param {TreeNode} root # @return {integer[][]} def zigzagLeve... 阅读全文
摘要：
108 Convert Sorted Array to Binary Search Tree递归解法还是非常直观的class Solution: # @param {integer[]} nums # @return {TreeNode} def sortedArrayToBST(... 阅读全文
摘要：
117 Populating Next Right Pointers in Each Node II就是 Bibary Tree Level order Traverseclass Solution: # @param root, a tree link node # @return n... 阅读全文
摘要：
102 Binary Tree Level Order Traversalclass Solution: # @param {TreeNode} root # @return {integer[][]} def levelOrder(self, root): if r... 阅读全文