| 9 | ) |
| 10 | |
| 11 | type TestTree[T constraints.Ordered] interface { |
| 12 | Push(...T) |
| 13 | Delete(T) bool |
| 14 | Get(T) (bt.Node[T], bool) |
| 15 | Empty() bool |
| 16 | Has(T) bool |
| 17 | Depth() int |
| 18 | Max() (T, bool) |
| 19 | Min() (T, bool) |
| 20 | Predecessor(T) (T, bool) |
| 21 | Successor(T) (T, bool) |
| 22 | PreOrder() []T |
| 23 | InOrder() []T |
| 24 | PostOrder() []T |
| 25 | LevelOrder() []T |
| 26 | AccessNodesByLayer() [][]T |
| 27 | } |
| 28 | |
| 29 | // BinarySearch, AVL and RB have completed the `TestTree` interface. |
| 30 | var ( |
no outgoing calls
no test coverage detected