232425262728293031323334353637383940414243444546474849505152535455565758596061

using System;

public class TreeNode
{
    public int data;
    public TreeNode left;
    public TreeNode right;

    public TreeNode(int val)
    {
        this.data = val;
        this.left = null;
        this.right = null;
    }
}

public class Solution
{
    // Function to compute the height of a subtree
    public int height(TreeNode node)
    {
        if (node == null) return 0;
        return 1 + Math.Max(height(node.left), height(node.right));
    }

    // Function to find the diameter of a binary tree (Brute Force)
    public int diameterOfBinaryTree(TreeNode root)
    {
        if (root == null) return 0;

        // Get the height of left and right subtrees
        int leftHeight = height(root.left);
        int rightHeight = height(root.right);

        // Calculate diameter through the current node
        int currentDiameter = leftHeight + rightHeight;

        // Recursively calculate the diameter of left and right subtrees
        int leftDiameter = diameterOfBinaryTree(root.left);
        int rightDiameter = diameterOfBinaryTree(root.right);

        // Return the maximum of the three values
        return Math.Max(currentDiameter, Math.Max(leftDiameter, rightDiameter));
    }
}

public class Program
{
    public static void Main(string[] args)
    {
        // Creating a test tree
        TreeNode root = new TreeNode(1);
        root.left = new TreeNode(2);
        root.right = new TreeNode(3);
        root.left.left = new TreeNode(4);
        root.left.right = new TreeNode(5);

        Solution sol = new Solution();
        Console.WriteLine("Diameter of the binary tree is: " + sol.diameterOfBinaryTree(root));
    }
}

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263

package main

import "fmt"

type TreeNode struct {
    Val   int
    Left  *TreeNode
    Right *TreeNode
}

// Function to find the diameter of a binary tree (Brute Force)
func diameterOfBinaryTree(root *TreeNode) int {
    if root == nil {
        return 0
    }

    // Helper to find max of two ints
    max := func(a, b int) int {
        if a > b {
            return a
        }
        return b
    }

    // Get the height of left and right subtrees
    leftHeight := height(root.Left)
    rightHeight := height(root.Right)

    // Calculate diameter through the current node
    currentDiameter := leftHeight + rightHeight

    // Recursively calcula