题目链接: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.
# 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
"""
count=0
if(root==None):
return 0
else:
count=count+1;
left_depth=self.maxDepth(root.left)
right_depth=self.maxDepth(root.right)
return max(left_depth,right_depth)+1