On Wed, 21 Feb 2007, anomie@??? wrote:
> ------- Comment #4 from anomie@??? 2007-02-21 17:38 -------
> On Wed, Feb 21, 2007 at 12:05:44PM +0000, ph10@??? wrote:
> >
> > The tree is a binary balanced tree. I do not know of an algorithm for removing
> > nodes and keeping the tree still balanced. These trees are intended for
> > additions, but not subtractions. Therefore, I don't think anybody will ever
> > write tree_removenode.
>
> Some quick searching turns up this algorithm for AVL balanced binary trees:
I suspect it isn't an AVL balanced tree (though not being sure what AVL
is, I can't be certain). The algorithm I use to build the tree comes
from Knuth, and I originally coded it many years ago.
I see absolutely no benefit from spending resources removing nodes from
the tree.
--
Philip Hazel University of Cambridge Computing Service
Get the Exim 4 book: http://www.uit.co.uk/exim-book
