Performs a sequence of random operations, given random inputs
to stress test the binary tree structure. This was useful during
development to find memory leaks / segfaults. Cycles should be
at least 100 times as large as values, or the delete, contains,
and get methods won’t hit very often.