From: "Nick Roberts" <Nick.Roberts@dial.pipex.com>
Subject: Re: Help with Deletion (not lazy) from AVL Trees
Date: 1999/03/11
Date: 1999-03-11T00:00:00+00:00 [thread overview]
Message-ID: <7c7co9$nvt$3@plug.news.pipex.net> (raw)
In-Reply-To: 7c3v0o$48$1@camel0.mindspring.com
I'm glad you have figured this one out. We are generally eager (possibly
sometimes slightly too eager :-) to help people with Ada problems here on
comp.lang.ada. Two things occur to me: it's funny how the same algorithm
can be expressed in so many (largely cosmetically) different ways, even in
the same language; most people use red-black trees rather than AVL trees
these days (often as a matter of fashion, I reckon), since (allegedly) RBTs
generally have better (search?) performance. (Oh and -- I don't mean this in
any kind of pejorative way -- but it's funny how you can tell a Modula
programmer/program who/that's been adapted to Ada :-)
-------------------------------------
Nick Roberts
-------------------------------------
next prev parent reply other threads:[~1999-03-11 0:00 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
1999-03-09 0:00 Help with Deletion (not lazy) from AVL Trees Bad Beta
1999-03-09 0:00 ` Bad Beta
1999-03-11 0:00 ` Nick Roberts [this message]
1999-03-12 0:00 ` Joel VanLaven
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox