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.
Subscribe to see which companies asked this question
# 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
left,right=0,0
if root.left:
left=self.maxDepth(root.left)
if root.right:
right=self.maxDepth(root.right)
dept=left if left>right else right
return dept+1
参考网上算法 写出来的。。。