Class Solution
-
- All Implemented Interfaces:
public final class Solution515 - Find Largest Value in Each Tree Row\.
Medium
Given the
rootof a binary tree, return an array of the largest value in each row of the tree (0-indexed).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
Constraints:
The number of nodes in the tree will be in the range <code>0, 10<sup>4</sup></code>.
<code>-2<sup>31</sup><= Node.val <= 2<sup>31</sup> - 1</code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final List<Integer>largestValues(TreeNode root)-
-
Method Detail
-
largestValues
final List<Integer> largestValues(TreeNode root)
-
-
-
-