Diameter of a Binary Tree.

The diameter of a binary tree is the length of the longest path between any two nodes in the tree, measured in terms of the number of edges. There are two main approaches to calculate the diameter of a binary tree: the naive approach using top-down recursion and the more efficient bottom-up approach.

In the naive approach, the diameter is calculated by recursively determining the height of the left and right subtrees for each node. For each node, the sum of the heights of its left and right subtrees is calculated, and the maximum of these sums is compared to the current maximum diameter. This process results in O(n^2) time complexity as the height is computed separately for each node. On the other hand, the bottom-up recursive approach optimizes this by calculating the height and diameter in the same recursive call. For each node, it computes the height of its subtrees and updates the diameter by checking if the sum of the left and right subtree heights exceeds the current maximum. This approach improves the time complexity to O(n), where n is the number of nodes in the tree, with auxiliary space complexity of O(h), where h is the height of the tree.

For more details, please go through - Diameter of a Binary Tree