Pytho树的直径的计算实现

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

class Solution:
    def diameter_of_binary_tree(self, root):
        self.diameter = 0  # 用于记录直径的最大值

        def depth(node):
            if not node:
                return 0

            left_depth = depth(node.left)
            right_depth = depth(node.right)

            # 更新直径的最大值
            self.diameter = max(self.diameter, left_depth + right_depth)

            # 返回当前节点的深度
            return 1 + max(left_depth, right_depth)

        depth(root)
        return self.diameter

# 构建一个二叉树
"""
       1
      / \
     2   3
    / \
   4   5
"""
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.left = TreeNode(4)
root.left.right = TreeNode(5)

sol = Solution()
diameter = sol.diameter_of_binary_tree(root)
print("树的直径:", diameter)