Medium
Quiz
#515 Find Largest Value in Each Tree Row
APPROACH
Given the root of a binary tree, return a list where each element is the maximum node value found at the corresponding depth level (0-indexed) of the tree.
Example 1:
Input: root = [1,3,2,5,3,null,9]
Output: [1,3,9]
Example 2:
Input: root = [1,2,3]
Output: [1,3]
1 of 4
1:00
What is the optimal approach for this problem?