【20250216】二叉树：515.在每个树中找最大值

class Solution:

def largestValues(self, root: TreeNode) -> List[int]:

if not root:

return []

result = []

queue = deque([root])

while queue:

size = len(queue)

max_val = float('-inf')

for i in range(size):

cur = queue.popleft()

max_val = max(max_val, cur.val)

if cur.left:

queue.append(cur.left)

if cur.right:

queue.append(cur.right)

result.append(max_val)

return result

class Solution:

def largestValues(self,root:TreeNode)->List[int]:

if not root:

return []

res=[]

queue=deque([root])

while queue:

level_max=float('-inf')

size=len(queue)

for i in range(size):

cur=queue.popleft()

level_max=max(level_max,cur.val)

if cur.left:

queue.append(cur.left)

if cur.right:

queue.append(cur.right)

res.append(level_max)

return res