2019年8月28日
104.二叉树的最大深度
摘要： # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def maxDepth(sel... 阅读全文
posted @ 2019-08-28 21:38 我叫郑小白 阅读(86) 评论(0) 推荐(0) 编辑
107.二叉树的遍历Ⅱ
摘要： # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def levelOrderBottom(self, root: TreeNode) -> List[Li... 阅读全文
posted @ 2019-08-28 21:33 我叫郑小白 阅读(103) 评论(0) 推荐(0) 编辑
108.将有序数组转换为二叉搜索树
摘要： # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def sortedArrayT... 阅读全文
posted @ 2019-08-28 19:11 我叫郑小白 阅读(117) 评论(0) 推荐(0) 编辑
100.相同的树
摘要： # Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def isSameTree(self, p: TreeNode, q: TreeNode) -> 阅读全文
posted @ 2019-08-28 18:53 我叫郑小白 阅读(150) 评论(0) 推荐(0) 编辑