ABSTRACT
Strengths: When the elements are inserted in a random order (i.e., in the order of a random permutation of the elements in the ordered collection), then good performance is obtained. No computation time is consumed to balance the search tree.
