PT07Z  Longest path in a tree
You are given an unweighted, undirected tree. Write a program to output the length of the longest path (from one node to another) in that tree. The length of a path in this case is number of edges we traverse from source to destination.
Input
The first line of the input file contains one integer N  number of nodes in the tree (0 < N <= 10000). Next N1 lines contain N1 edges of that tree  Each line contains a pair (u, v) means there is an edge between node u and node v (1 <= u, v <= N).
Output
Print the length of the longest path on one line.
Example
Input: 3 1 2 2 3 Output: 2
hide comments
scolar_fuad:
20190904 06:04:59
Simple dfs problem ...


jame___boy:
20190830 00:30:33
many many thanx @anand_undavia for sharing the link.......


hetp111:
20190824 05:04:07
2 dfs:


sonianand966:
20190821 15:08:26
Did it using 2bfs method however was a difficult one as an all new question! 

manas_uchiha10:
20190819 15:58:37
AC in one go!! 

elzahaby:
20190814 22:05:54
using 2 BFS can't do it with DFS acctually idk why xD 

rockstar_786:
20190705 22:15:49
@sarthak_1998 bro i was getting the same its due to small memory allocation of declared array.


an09mous:
20190703 12:12:10
We can precompute heights of all the subtrees in an array for faster computation 

shahayush457:
20190702 09:37:56
Just use 2 dfs :) 

sarthak_1998:
20190626 17:26:59
My code is giving runtime error (SIGSEGV) however it is giving right answer on every test case I tried. Please, someone, help me.

Added by:  ThanhVy Hua 
Date:  20070328 
Time limit:  0.5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Coauthor Amber 