题目描述:
给定一个二叉树,找出其最大深度。
二叉树的深度为根节点到最远叶子节点的最长路径上的节点数。
说明: 叶子节点是指没有子节点的节点。
示例:
给定二叉树 [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回它的最大深度 3 。
解题思路:
代码实现:
# 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 is None:
return 0
else:
q = [(1, root)]
max_depth = 0
while q:
depth, cur_node = q.pop(0)
if cur_node is not None:
max_depth = max(depth, max_depth)
q.append((depth + 1, cur_node.left))
q.append((depth + 1, cur_node.right))
return max_depth
还有一个直观的方法,就是递归,采用深度优先的方式搜索:
代码如下:
# 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 is None:
# return 0
# else:
# q = [(1, root)]
# max_depth = 0
# while q:
# depth, cur_node = q.pop(0)
# if cur_node is not None:
# max_depth = max(depth, max_depth)
# q.append((depth + 1, cur_node.left))
# q.append((depth + 1, cur_node.right))
# return max_depth
if root is None:
return 0
else:
left_height = self.maxDepth(root.left)
right_height = self.maxDepth(root.right)
return max(left_height, right_height) + 1