[LeetCode]题解（python）：104 Maximum Depth of Binary Tree

Posted 2020-07-06 loadofleaf

题目来源

---

https://leetcode.com/problems/maximum-depth-of-binary-tree/

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.

---

题意分析

---

Input: tree

Output: int

Conditions:给定一个二叉树，返回最大深度

---

题目思路

---

递归遍历即可

---

AC代码（Python）

 1 # Definition for a binary tree node.
 2 # class TreeNode(object):
 3 #     def __init__(self, x):
 4 #         self.val = x
 5 #         self.left = None
 6 #         self.right = None
 7 
 8 class Solution(object):
 9     def maxDepth(self, root):
10         """
11         :type root: TreeNode
12         :rtype: int
13         """
14         if root == None:
15             return 0
16         else:
17             return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1