Question: https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
Question Name: Maximum Depth of Binary Tree
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | # Definition for a binary tree node # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: # @param root, a tree node # @return an integer def maxDepth(self, root): if root == None: return 0 else: return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right)) |