A new approach for providing an efficient implementation of concatenable ordered lists is discussed. The structures described have an equivalence to search trees. In balanced search trees the tree is continually modified to maintain certain balance properties; with our structure the tree is guaranteed to be structured randomly and with very high probability is relatively balanced. We thus avoid the overhead associated with explicitly maintaining the balance. Because of this property, the structures described are referred to as guaranteed-random trees.