Day 11 - Diameter of binary tree

Solution.py

# https://leetcode.com/explore/challenge/card/30-day-leetcoding-challenge/529/week-2/3293/

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Result:
    def __init__(self, diameter, longestPath):
        self.diameter = diameter
        self.longestPath = longestPath

class Solution:
    def diameterOfBinaryTree(self, root: TreeNode) -> int:
        return self.computeDiameter(root).diameter
    
    def computeDiameter(self, root: TreeNode) -> Result:
        if not root:
            return Result(0, 0)
        
        L = self.computeDiameter(root.left)
        R = self.computeDiameter(root.right)
        
        diameter = max(L.longestPath + R.longestPath, L.diameter, R.diameter)
        longestPath = max(L.longestPath, R.longestPath) + 1
        
        return Result(diameter, longestPath)