 New update is available. Click here to update.

# Maximum Height Tree

Last Updated: 25 Jun, 2021
Difficulty: Hard

## PROBLEM STATEMENT

#### You are given a tree with ‘N’ nodes and ‘N-1’ edges. Your task is to determine the tree's maximum height when we consider any arbitrary node as a root.

##### For Example:
``````N = 4
Edges = [2 3], [4 3], [1 3]

Output: 2

Here node 4 is at a distance 2 from node 1 and if we make node 1 as a root, it will give the height of 2, which is the maximum possible in this tree.
``````
##### Input Format:
``````The first line contains a single integer 'T' denoting the number of test cases to be run. Then the test cases follow.

The first line of each test contains integer 'N' denoting the number of nodes in the tree, and the following N-1 lines contain two nodes each.
``````
##### Output Format:
``````For each test case, print an integer denoting the tree's maximum height when we consider any arbitrary node as a root.
``````
##### Note
``````You are not required to print anything; it has already been taken care of. Just implement the function.
``````
##### Constraints:
``````1 <= T <= 50
1 <= N <= 10^4

Time Limit: 1 sec.
``````