(node, nilNode Node[T])
| 123 | } |
| 124 | |
| 125 | func maximum[T constraints.Ordered](node, nilNode Node[T]) Node[T] { |
| 126 | if node == nilNode { |
| 127 | return node |
| 128 | } |
| 129 | |
| 130 | for node.Right() != nilNode { |
| 131 | node = node.Right() |
| 132 | } |
| 133 | return node |
| 134 | } |
| 135 | |
| 136 | func levelOrderHelper[T constraints.Ordered](root, nilNode Node[T], traversal *[]T) { |
| 137 | var q []Node[T] // queue |
no test coverage detected