From: vaxs09@alpha.tst.tracor.com (John Briggs)
Subject: Re: binairy trees
Date: 1998/02/19
Date: 1998-02-19T00:00:00+00:00 [thread overview]
Message-ID: <1998Feb19.172958@alpha.tst.tracor.com> (raw)
In-Reply-To: 34EC5F3A.6023@er.uqam.ca
In article <34EC5F3A.6023@er.uqam.ca>, jj091849@er.uqam.ca writes:
> Hi all, I'm looking for ada code
> 1) To build up a binairy tree
> 2) Insert in a binairy tree
> 3) Search in a binairy tree
> 4) Delete in a binairy tree
Why? It's more educational to write your own. Plus you get code
that fits your unstated requirements.
Personally, I find linked lists work better than binary trees when
no search key is present. You save all that effort maintaining
the right hand link.
John Briggs vaxs09@alpha.tst.tracor.com
prev parent reply other threads:[~1998-02-19 0:00 UTC|newest]
Thread overview: 3+ messages / expand[flat|nested] mbox.gz Atom feed top
1998-02-19 0:00 binairy trees jj091849
1998-02-19 0:00 ` Stephen Leake
1998-02-19 0:00 ` John Briggs [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox