摘要:
题目描述: 方法一; class Solution(object): def levelOrder(self, root): if not root: return [] ans = [] stack = [root] while stack: tem_stack = [] tem_ans = [] 阅读全文
摘要:
题目描述: 方法一: class Solution(object): def levelOrderBottom(self, root): """ :type root: TreeNode :rtype: List[List[int]] """ if not root: return [] ans = 阅读全文
摘要:
题目描述: 第一次提交: class Solution(object): def maxDepth(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 elif root.left==None and 阅读全文