[勇者闯LeetCode] 104. Maximum Depth of Binary Tree

[勇者闯LeetCode] 104. Maximum Depth of Binary Tree

Description

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Information

Tags: Tree | Depth-first Search

Difficulty: Easy

Solution

采用递归：二叉树的最大深度=max（左子树的最大深度，右子树的最大深度）+1

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

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