<?xml version="1.0" encoding="ISO-8859-1"?>

<!DOCTYPE message PUBLIC
  "-//MLarc//DTD MLarc output files//EN"
  "../../mlarc.dtd"[
  <!ATTLIST message
    listname CDATA #REQUIRED
    title CDATA #REQUIRED
  >
]>

  <?xml-stylesheet href="../../mlarc.xsl" type="text/xsl"?>


<message 
  url="2003/11/f0ae170ec3837507642505ac411c4dd9"
  from="Diego Olivier Fernandez Pons &lt;Diego.FERNANDEZ_PONS@e...&gt;"
  author="Diego Olivier Fernandez Pons"
  date="2003-11-12T16:17:58"
  subject="RE: [Caml-list] Efficient and canonical set representation?"
  prev="2003/11/e8fd0dfd31a596714c76d480bdfae207"
  next="2003/11/8f2ee87fc20d2eebce952ca4abe9d3be"
  prev-in-thread="2003/11/4a8990a1ef715e68cd8d34483ae5ee9b"
  prev-thread="2003/11/ae2317e348119907279987d644ffa2ec"
  next-thread="2003/11/a64bd700deb07acf9ea74cea02719abc"
  root="../../"
  period="month"
  listname="caml-list"
  title="Archives of the Caml mailing list">

<thread subject="RE: [Caml-list] Efficient and canonical set representation?">
<msg 
  url="2003/11/978db28d889e2aac657b467588e07c8c"
  from="Harrison, John R &lt;johnh@i...&gt;"
  author="Harrison, John R"
  date="2003-11-12T00:21:02"
  subject="RE: [Caml-list] Efficient and canonical set representation?">
<msg 
  url="2003/11/4a8990a1ef715e68cd8d34483ae5ee9b"
  from="Brian Hurt &lt;bhurt@s...&gt;"
  author="Brian Hurt"
  date="2003-11-12T01:05:57"
  subject="RE: [Caml-list] Efficient and canonical set representation?">
</msg>
<msg 
  url="2003/11/f0ae170ec3837507642505ac411c4dd9"
  from="Diego Olivier Fernandez Pons &lt;Diego.FERNANDEZ_PONS@e...&gt;"
  author="Diego Olivier Fernandez Pons"
  date="2003-11-12T16:17:58"
  subject="RE: [Caml-list] Efficient and canonical set representation?">
</msg>
</msg>
</thread>

<contents>
    Bonjour,

&gt; Is it just a coincidence that the numerous varieties of balanced
&gt; tree (AVL, 2-3-4, red-black, ...) all seem to be non-canonical? Or
&gt; is it essential to their efficiency? (Perhaps this is a question for
&gt; another forum.)

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.


        Diego Olivier

-------------------
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

</contents>

</message>

