小黑天寒地冻来到平谷蹭饭，抽几分钟的leetcode之旅:剑指 Offer II 045. 二叉树最底层最左边的值-CSDN博客

本文链接：https://blog.csdn.net/qq_37418807/article/details/128756829

小黑代码

# 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: TreeNode) -> int:
        self.max_ = 0
        self.node = None
        # 递归函数
        def dfs(node, depth = 0):
            if not node:
                return
            depth += 1
            # 以左结点为基准
            if depth > self.max_:
                self.max_ = depth
                self.node = node
            dfs(node.left, depth)
            dfs(node.right, depth)
        dfs(root)
        return self.node.val

在这里插入图片描述

层次遍历

# 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: TreeNode) -> int:
        if not root:
            return 
        # 初始化队列
        q = collections.deque([root])
        top = None
        while q:
            top = q.popleft()
            # 先右后左
            if top.right:
                q.append(top.right)
            if top.left:
                q.append(top.left)
        return top.val