剑指offer55 二叉树的深度（python实现）

最新推荐文章于 2021-02-23 21:31:29 发布

小怡情ifelse

最新推荐文章于 2021-02-23 21:31:29 发布

阅读量235

点赞数

分类专栏： Python 数据结构与算法

本文链接：https://blog.csdn.net/luobo140716/article/details/102693670

版权

数据结构与算法同时被 2 个专栏收录

89 篇文章 0 订阅

订阅专栏

Python

17 篇文章 1 订阅

订阅专栏

class TreeNode:
    def __init__(self, x):
        self.val = x
        self.left = None
        self.right = None


class Tree:
    def TreeDepth(self, pRoot):
        if pRoot is None:
            return 0
        llength = self.TreeDepth(pRoot.left)
        rlength = self.TreeDepth(pRoot.right)
        return max(llength, rlength) + 1

root = TreeNode(10)
secondNode = TreeNode(9)
threeNode = TreeNode(8)
secondNode.left = threeNode
root.left = secondNode

s = Tree()
value = s.TreeDepth(root)
print('二叉树的深度是%d' % value)

力扣经典题解：

https://leetcode-cn.com/problems/er-cha-shu-de-shen-du-lcof/solution/mian-shi-ti-55-i-er-cha-shu-de-shen-du-xian-xu-bia/

打印：

二叉树的深度是3