leetcood学习笔记-104-二叉树的最大深度

题目描述：

第一次提交：

class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if not root:
            return
        elif root.left==None and root.right==None:
            return
        elif root.left==None and root.right!=None:
            return +self.maxDepth(root.right)
        elif root.left!=None and root.right==None:
            return +self.maxDepth(root.left)
        else:
            return +max(self.maxDepth(root.left),self.maxDepth(root.right))

优化后：

class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root!=None:
            return max(self.maxDepth(root.left), self.maxDepth(root.right)) +
        else:
            return