Re: [Ocaml-lib-devel] PSQueue news

[Diego O. F. P. <Die...@et...>]

    Bonjour,

On Fri, 30 May 2003, Brian Hurt wrote:

> Basically, what I need to do is break my single modify function into three
> different functions- one for insert (number of nodes increases), one for
> delete (number of node decreases), and while I'm at it one for update
> (number of nodes and structure of the tree remains the same).

Why don't you try AVL balancing scheme ? As stated by Ralf Hinze, it
does not have the property of a finite number of rebalancing
operations in the delete process (logarithmic instead) but should be
much more easy to implement. Ralf Hinze uses in his paper the
weight-balanced scheme which is quite similar.

        Diego Olivier