题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
方法分成递归和非递归
递归方法是:
# -*- 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
ans = 0
if pRoot == None:
return ans
left = self.TreeDepth(pRoot.left);
right = self.TreeDepth(pRoot.right);
return max(left, right) + 1
非递归方法:利用层序遍历的方法进行
# -*- coding:utf-8 -*-
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def TreeDepth(self, pRoot):
res = [] # 存储最后层次遍历的结果
ans = 0 # 层数
if