#513

Find Bottom Left Tree Value

pupil · 535 · lc medium +28 · verified · 72.2% accepted · 3,999 likes · top 81%

Description

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

Code

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def findBottomLeftValue(self, root: Optional[TreeNode]) -> int:

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def findBottomLeftValue(self, root: Optional[TreeNode]) -> int: