From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: * X-Spam-Status: No, score=1.2 required=5.0 tests=BAYES_00,FROM_WORDY, INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,abc7dd97bf9a7dc7 X-Google-Attributes: gid103376,public From: "Nick Roberts" Subject: Re: Help with Deletion (not lazy) from AVL Trees Date: 1999/03/11 Message-ID: <7c7co9$nvt$3@plug.news.pipex.net>#1/1 X-Deja-AN: 453648271 References: <7c2g6c$5e1$1@camel25.mindspring.com> <7c3v0o$48$1@camel0.mindspring.com> X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Organization: UUNET WorldCom server (post doesn't reflect views of UUNET WorldCom) Newsgroups: comp.lang.ada Date: 1999-03-11T00:00:00+00:00 List-Id: 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 -------------------------------------