2022-03-27 20:52:13 +08:00
< p > Given the < code > root< / code > of a binary tree, return < em > an array of the largest value in each row< / em > of the tree < strong > (0-indexed)< / strong > .< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:52:13 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2020/08/21/largest_e1.jpg" style = "width: 300px; height: 172px;" / >
< pre >
< strong > Input:< / strong > root = [1,3,2,5,3,null,9]
< strong > Output:< / strong > [1,3,9]
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:52:13 +08:00
< pre >
< strong > Input:< / strong > root = [1,2,3]
< strong > Output:< / strong > [1,3]
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > The number of nodes in the tree will be in the range < code > [0, 10< sup > 4< / sup > ]< / code > .< / li >
< li > < code > -2< sup > 31< / sup > < = Node.val < = 2< sup > 31< / sup > - 1< / code > < / li >
< / ul >
