牛客网上的剑指 offer的在线编程:
题目描述:
输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
# -*- coding: utf-8 -*-
# depth of erchashu
class TreeNode:
def __int__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def TreeDepth(self, pRoof):
if pRoof == None:
return 0
ldepth = Solution.TreeDepth(self, pRoof.left)
rdepth = Solution.TreeDepth(self, pRoof.right)
return max(ldepth, rdepth) + 1