二叉树的深度
【题目】:
输入一颗二叉树的根节点,求该二叉树的深度。二叉树的深度是从根节点到叶子节点所形成的最长的路径。
【解题思路】:
递归,分别求取左子树和右子数的深度,然后将最大的值加1进行返回。
示例代码:
# define a tree node
class TreeNode(object):
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def tree_deep(root):
if not root:
return 0 # 这儿不能return None, 否则不能参与下面return+1的计算
left = tree_deep(root.left)
right = tree_deep(root.right)
return max(left, right) + 1
# test
# creat a tree
def creat_tree(nums, index):
if not nums:
return None
if index >= len(nums):
return None
root = TreeNode(nums[index])
root.left = creat_tree(nums, index * 2 + 1)
root.right = creat_tree(nums, index * 2 + 2)
return root
root = creat_tree([1, 2, 3, None, 5, None, 6, None, None, 7], 0)
print(tree_deep(root))
运行结果: