Skip to content

Latest commit

 

History

History
18 lines (14 loc) · 289 Bytes

README.md

File metadata and controls

18 lines (14 loc) · 289 Bytes

Task

Link

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]

Solutions