6. Diameter of Binary Tree

Given a binary tree, you need to compute the length of the diameter of the tree.

. The diameter of a binary tree is the length of the longest path between any two nodes in a tree.

Different Conditions of finding diameter

Solution: (Using Depth and Storing the possible diameter)

class Solution
{
public:
    int res = 0;

    int findDiameter(TreeNode *root)
    {
        if (root == NULL)
        {
            return 0;
        }

        int ld = findDiameter(root->left);
        int rd = findDiameter(root->right);

        res = max(res, ld + rd);

        return max(ld, rd) + 1;
    }

    int diameterOfBinaryTree(TreeNode *root)
    {
        if (root == NULL)
        {
            return 0;
        }

        findDiameter(root);

        return res;
    }
};

Time Complexity: O(n)