Leetcode:515. 在每个树行中找最大值 - 力扣(LeetCode) (leetcode-cn.com)
层序遍历
时间复杂度:O(n)
空间复杂度:O(n)
代码如下:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
import sys
class Solution(object):
def largestValues(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
queue,visited=[],[]
if root:
queue.append(root)
while queue:
layer_max=-sys.maxint-1
tmp=[]
while queue:
node=queue.pop(0)
if node.val>layer_max:
layer_max=node.val
if node.left:
tmp.append(node.left)
if node.right:
tmp.append(node.right)
visited.append(layer_max)
queue=tmp
return visited