Available question text
Given an undirected tree, find its diameter — the maximum distance (sum of edge weights, or number of edges if unweighted) along any simple path between two nodes. This is typically solved with tree traversals (e.g., two BFS/DFS passes or tree DP) to compute farthest-node distances.
Related questions
Continue with questions that share topics or the same question type.
- Diameter of Binary Tree
Coding · Binary Tree · Depth-First Search · DP on Trees
- Diameter of N-Ary Tree
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1245. Tree Diameter
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source