应用题-二叉树专题-找树左下角的值
- 版权声明：本站原创文章，于2026-03-31，由 管理员 发表。
- 转载请注明： 应用题-二叉树专题-找树左下角的值 | CodeGarden
```python
# 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:
self.h = -1
self.v = 0
def get_l( r, h ):
if not r: return
get_l( r.left, h + 1 )
if not r.left and not r.right:
if h > self.h:
self.h = h
self.v = r.val
get_l( r.right, h + 1 )
get_l( root, 0 )
return self.v
```