Max Distance

CodeChefOpen on judge ↗

You are Given a tree of N nodes. Nodes are numbered from 1 to N. A node is called valuabe,if it is derectly connected with exacly one node. That means it has exactly one edge. Distance between two node is the shortest number of edge needed to reach from one node to another. You have to find the maximum distance between any two valuabe nodes. Input First line contains a integer n(2Output Pri

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI