题目描述
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
依题意可知:求当前二叉树的深度
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
global h
h = None
def TreeDepth(self, pRoot):
# write code here
if pRoot is None:
return 0
global h
h = 1
self.Tree_Depth(pRoot, 1)
return h
def Tree_Depth(self, pRoot, depth):
global h
if pRoot is not None:
if h < depth:
h = depth
self.Tree_Depth(pRoot.left, depth + 1)
self.Tree_Depth(pRoot.right, depth + 1)