摘要:
好开心,我终于独立完成了!!!! class Solution: def sortedArrayToBST(self, nums: List[int]) -> TreeNode: if len(nums)==0: return None i=len(nums)//2 root=TreeNode(nu 阅读全文
摘要:
class Solution: def isBalanced(self, root: TreeNode) -> bool: if not root: return True def helper(node): if not node: return 0 left=helper(node.left) 阅读全文
摘要:
同111题 class Solution(object): def maxDepth(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 left = self.maxDepth(root.left) 阅读全文
摘要:
0.。。。。 class Solution(object): def minDepth(self, root): """ :type root: TreeNode :rtype: int """ if not root: return 0 left = self.minDepth(root.left 阅读全文
摘要:
不是自己想出来的,什么时候才能独立完成树的题。 class Solution(object): def levelOrder(self, root): """ :type root: TreeNode :rtype: List[List[int]] """ levels=[] if not root 阅读全文