二叉树_二叉树的深度
题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
参考答案
# -*- 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
left = self.TreeDepth(pRoot.left) + 1
right = self.TreeDepth(pRoot.right) + 1
return max(left,right)
法二:借鉴了第二十四题:二叉树中和为某一值的路径中的解法。
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def __init__(self):
self.length = 0
self.lengthall = [0]
def TreeDepth(self, pRoot):
# write code here
if not pRoot:
return max(self.lengthall)
self.length += 1
if not pRoot.left and not pRoot.right:
self.lengthall.append(self.length)
if pRoot.left:
self.TreeDepth(pRoot.left)
if pRoot.right:
self.TreeDepth(pRoot.right)
self.length -= 1
return max(self.lengthall)