513 找树左下角的值
给定一个二叉树的 根节点 root
,请找出该二叉树的 最底层 最左边 节点的值。
假设二叉树中至少有一个节点。
输入: root = [2,1,3]
输出: 1
输入: [1,2,3,4,null,5,6,null,null,7]
输出: 7
# 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:
# 非递归
# results = []
# if not root:return
# from collections import deque
# que = deque([root])
# while que:
# result = []
# n = len(que)
# for _ in range(n):
# node = que.popleft()
# result.append(node.val)
# if node.left:
# que.append(node.left)
# if node.right:
# que.append(node.right)
# results.append(result)
# return results[-1][0]
# 递归
res = []
def helper(root, depth):
if len(res) == depth:res.append([])
res[depth].append(root.val)
if root.left:
helper(root.left, depth+1)
if root.right:
helper(root.right, depth+1)
helper(root, 0)
return res[-1][0]