Error
|
|
---|---|
@Ibrahim Nash | 6379 |
@blackshadows | 6329 |
@mb1973 | 5358 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3357 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@ritiksethi21 | 1050 |
@aroranayan999 | 807 |
@RizulBansal | 685 |
@ashishtrehan002 | 538 |
@hemantgarg923 | 528 |
@simrangoyal | 526 |
@ronaldo77 | 520 |
@anishrajan | 505 |
@thanosagain | 505 |
@ssparteek470 | 495 |
@rahul2312 | 491 |
Complete Leaderboard |
Given a tree with N nodes rooted at 1, the task is to find the maximum distance of node X from any other node
Note: All the nodes are numbered from 1 to N.
Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two space-separated single integers N and X.
3. Next N-1 lines contain two space-separated integers u and v, represents an edge in between them
Output: For each test case, print the answer
Constraints:
1. 1 <= T <= 5
2. 1 <= X <= N <= 105
Example:
Input:
2
4 2
1 2
3 4
4 1
5 3
1 2
2 3
3 4
4 5
Output:
3
2
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes