A simple, unbalanced binary search tree. Because trees are unbalanced, operations have worst-case behavior linear in the number of tree nodes. Moderate cleverness (by being random) should provide logarithmic average-case behavior, particularly for off-line algorithms. Developed in Pharo 8.0, runs on Squeak image 4.5.