New returns a new, random binary tree holding the values 1k, 2k, ..., nk.
(n, k int)
| 75 | // New returns a new, random binary tree |
| 76 | // holding the values 1k, 2k, ..., nk. |
| 77 | func New(n, k int) *Tree { |
| 78 | var t *Tree |
| 79 | for _, v := range rand.Perm(n) { |
| 80 | t = insert(t, (1+v)*k) |
| 81 | } |
| 82 | return t |
| 83 | } |
| 84 | |
| 85 | // New returns a new, empty binary tree |
| 86 | func NewTree() *Tree { |