]> | It is not a coincidence. I remember having read somewhere that it | could be proven that if a balanced tree (based on comparisons) did not | have enough different representations of a same set, then the | insertion could not be done in logarithmic time. Interesting. I was beginning to suspect that might be the case. Does anyone have an exact reference for such a result? John. ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners