Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 513. Find Bottom Left Tree Value
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.