Find Largest Value in Each Tree Row
Description:
You need to find the largest value in each row of a binary tree.
Example
Input: [1,3,2,5,3,#,9]
Output: [1, 3, 9]
Code:
"""
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
self.val = val
self.left, self.right = None, None
"""
class Solution:
"""
@param root: a root of integer
@return: return a list of integer
"""
def largestValues(self, root):
# write your code here
layer = [root]
newLayer = []
res = []
while layer:
res.append(0)
for node in layer:
if node.left:
newLayer.append(node.left)
if node.right:
newLayer.append(node.right)
res[-1] = max(res[-1], node.val)
layer[:] = newLayer[:]
newLayer[:] = []
return res