Available question text
The source lists this question by title. A full statement is not available in this collection.
Check the source for more detail. You can use the workspace to record questions, notes, and an approach.
This entry contains problem metadata. Read the source for the complete statement.
Related questions
Continue with questions that share topics or the same question type.
- Add One Row to Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- 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
- Maximum Depth of Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
LeetCode · 1 record
No company association
Official problem listing
Find Diameter Endpoints of a Tree
Source snapshot: Nov 13, 2026
Verified official problem metadata. This is not evidence of a recent interview ask.
View source (may require access)
LeetCode company tags · 1 record
Agoda
Archived company tags
Find Diameter Endpoints of a Tree
Source window: all_time
Source snapshot: Oct 20, 2026
Historical tags, not proof of a recent interview ask. Snapshot: 2026-10-20.
View source