【leetcode】(python) 104. Maximum Depth of Binary Tree二叉树的最大深度

104. Maximum Depth of Binary Tree Easy

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
    /  \
   15   7

return its depth = 3.

题意

求二叉树的最大深度

解题思路

用递归的思想，返回左子树和右子树的最大深度再加上自己的深度1。

code

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

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