Maximum Depth of Binary Tree Leetcode #104 题解[Python]

题目来源

---

https://leetcode.com/problems/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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

3
/ \
9 20
/ \ / \
NN15 7

return its depth = 3.

给出一棵二叉树, 求它的深度.

解题思路

---

水题. 三行解决.
Tip: 这道题用宽搜把代码写好应该可以更快.

代码实现

---

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

代码表现

---