Available question text
Given a binary tree and a target node value, return the value of the nearest leaf measured by edge distance — you may move both down to children and up to parents. The core idea is to treat the tree as an undirected graph (or add parent pointers) and perform a BFS from the target to find the closest leaf.
Related questions
Continue with questions that share topics or the same question type.
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
- Closest Binary Search Tree Value II
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Closest Nodes Queries in a Binary Search Tree
Coding
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
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 742. Closest Leaf in a Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source