Maximum-Depth-of-Binary-Tree Posted on 2015-03-17 | In Leetcode ##Maximum Depth of Binary Tree class Solution: # @param root, a tree node # @return an integer def maxDepth(self, root): if not root: return 0 else: return max(self.maxDepth(root.left), self.maxDepth(root.right))+1