Available question text
Return the leftmost value in the last row of a binary tree — i.e., find the first node in the deepest level. This is a tree traversal problem (level-order or depth-tracking DFS) to identify the deepest level and its leftmost node.
Related questions
Continue with questions that share topics or the same question type.
- Find Largest Value in Each Tree Row
Coding
- Find the Left and Right Side View of a Binary Search Tree
Coding
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
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 513. Find Bottom Left Tree Value
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source