vlambda博客
学习文章列表

    def printTree(self, t: TreeNode): if t is not None: print(t.val, ' ') self.printTree(t.left) self.printTree(t.right)

    def printTree(self, t: TreeNode): if t is not None: self.printTree(t.left)            print(t.val, ' ') self.printTree(t.right)

 def printTree(self, t: TreeNode): if t is not None:            self.printTree(t.left) self.printTree(t.right) print(t.val, ' ')

def levelOrder(root: TreeNode) -> list: if root is None: return []
 res= [] queue = [root] while queue: temp = [] res_t = [] for node in queue: res_t.append(node.val) if node.left: temp.append(node.left) if node.right: temp.append(node.right) queue = temp res.append(res_t)
 return res