(node, nilNode Node[T])
| 112 | } |
| 113 | |
| 114 | func minimum[T constraints.Ordered](node, nilNode Node[T]) Node[T] { |
| 115 | if node == nilNode { |
| 116 | return node |
| 117 | } |
| 118 | |
| 119 | for node.Left() != nilNode { |
| 120 | node = node.Left() |
| 121 | } |
| 122 | return node |
| 123 | } |
| 124 | |
| 125 | func maximum[T constraints.Ordered](node, nilNode Node[T]) Node[T] { |
| 126 | if node == nilNode { |