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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 513. Find Bottom Left Tree Value

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact