Skip to content

Latest commit

 

History

History
7 lines (6 loc) · 607 Bytes

File metadata and controls

7 lines (6 loc) · 607 Bytes

PREREQUISITE : DFS

EXPLANATION :

Diameter of a tree means the Maximum distance between any two nodes of the tree . It is very Obvious that , Maximum distance in a tree will be the distance between two leaf nodes. So , all we need to do is first we will run a DFS from any node in the tree and the Node which will have maximum distance surely will be a Leaf node . Then We will run another DFS from that Leaf node and find another leaf node by mentioned process . The distance to that leaf node will be the diameter of the tree .