题目来源:
https://leetcode.com/problems/maximum-depth-of-binary-tree/
题意分析:
返回一个树的最大层数。
题目思路:
这里用递归的思想,maxlevel = max( maxleft, maxright) + 1.
代码(python):
# 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 == None: return 0 return max(self.maxDepth(root.left),self.maxDepth(root.right)) + 1