Min returns the Min value of the tree
()
| 131 | |
| 132 | // Min returns the Min value of the tree |
| 133 | func (t *BinarySearch[T]) Min() (T, bool) { |
| 134 | ret := minimum[T](t.Root, t._NIL) |
| 135 | if ret == t._NIL { |
| 136 | var dft T |
| 137 | return dft, false |
| 138 | } |
| 139 | return ret.Key(), true |
| 140 | } |
| 141 | |
| 142 | // Predecessor returns the Predecessor of the node of Key |
| 143 | // if there is no predecessor, return default value of type T and false |