513. Find the value in the lower left corner of the tree

# 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:
        '''  Level traversal + The nodes with uniform depth are put into an array + Returns the first value of the last array  '''
        q = [root]
        while q:
            length = len(q)
            tem = []
            for _ in range(length):
                node = q.pop(0)
                tem.append(node.val)
                if node.left:q.append(node.left)
                if node.right:q.append(node.right)
        return tem[0]