36 lines
564 B
Go
36 lines
564 B
Go
|
package main
|
||
|
|
|
||
|
|
import (
|
||
|
|
aq "github.com/emirpasic/gods/v2/queues/arrayqueue"
|
||
|
|
)
|
||
|
|
|
||
|
|
func largestValues(root *TreeNode) []int {
|
||
|
|
q := aq.New[*TreeNode]()
|
||
|
|
if root != nil {
|
||
|
|
q.Enqueue(root)
|
||
|
|
}
|
||
|
|
|
||
|
|
largest := make([]int, 0)
|
||
|
|
for !q.Empty() {
|
||
|
|
node, _ := q.Peek()
|
||
|
|
foundMax := node.Val
|
||
|
|
|
||
|
|
n := q.Size()
|
||
|
|
for i := 0; i < n; i++ {
|
||
|
|
node, _ := q.Dequeue()
|
||
|
|
foundMax = max(foundMax, node.Val)
|
||
|
|
|
||
|
|
if node.Left != nil {
|
||
|
|
q.Enqueue(node.Left)
|
||
|
|
}
|
||
|
|
if node.Right != nil {
|
||
|
|
q.Enqueue(node.Right)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
largest = append(largest, foundMax)
|
||
|
|
}
|
||
|
|
|
||
|
|
return largest
|
||
|
|
}
|