题目描述:
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。:
思路:二叉树的遍历有两种解决方式:一种是dfs(深度优先遍历)是一种利用递归实现的搜索算法,一种是bfs(广度优先遍历)是一种利用对列实现的搜索算法。bfs的重点在于队列,dfs的重点在于递归,这是本质区别
深度优先:树的高度=左子树和右子树的最大值+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):
# write code here
if pRoot is None:
return 0
l = self.TreeDepth(pRoot.left)
r = self.TreeDepth(pRoot.right)
if l>r:
return l+1
else:
return r+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):
# write code here
if pRoot is None:
return 0
q = [] #建立队列,盛放结点
q.append(pRoot)
res = 0
while q:
size = len(q)
for i in range(size):
pNode = q.pop(0)
if pNode.left:
q.append(pNode.left)
if pNode.right:
q.append(pNode.right)
res+=1 #每层结点遍历结束,计算层数
return res
版权声明:本文为博主原创文章,未经博主允许不得转载。https://blog.csdn.net/yl_mouse