题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
代码实现
解法一:递归的方法
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def TreeDepth(self, pRoot):
# write code here
if not pRoot:
return 0
return max(1+self.TreeDepth(pRoot.left),1+self.TreeDepth(pRoot.right))
解法二:循环
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def TreeDepth(self, pRoot):
# write code here
if not pRoot:
return 0
a=[pRoot]
depth=0
while a:
b=[]
for i in a:
if i.left:
b.append(i.left)
if i.right:
b.append(i.right)
a=b
depth+=1
return depth