Medium
Quiz
#513 Find Bottom Left Tree Value
APPROACH
Given the root of a binary tree, find the deepest level of the tree and return the value of the leftmost node at that level.
Example 1:
Input: root = [2,1,3]
Output: 1
Example 2:
Input: root = [1,2,3,4,null,5,6,null,null,7]
Output: 7
1 of 4
1:00
What is the optimal approach for this problem?