comp.lang.ada
 help / color / mirror / Atom feed
* binairy trees
@ 1998-02-19  0:00 jj091849
  1998-02-19  0:00 ` John Briggs
  1998-02-19  0:00 ` Stephen Leake
  0 siblings, 2 replies; 3+ messages in thread
From: jj091849 @ 1998-02-19  0:00 UTC (permalink / raw)



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
Thank's




^ permalink raw reply	[flat|nested] 3+ messages in thread

* Re: binairy trees
  1998-02-19  0:00 binairy trees jj091849
  1998-02-19  0:00 ` John Briggs
@ 1998-02-19  0:00 ` Stephen Leake
  1 sibling, 0 replies; 3+ messages in thread
From: Stephen Leake @ 1998-02-19  0:00 UTC (permalink / raw)



jj091849@er.uqam.ca wrote:
> 
> 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
> Thank's

Assuming you meant "binary" trees, there is some code, copyrighted for
educational usage only, in Jack Biedler's collection of data structures.
Download from:

http://academic.uofs.edu/faculty/beidler/ADA/default.html


-- 
- Stephe




^ permalink raw reply	[flat|nested] 3+ messages in thread

* Re: binairy trees
  1998-02-19  0:00 binairy trees jj091849
@ 1998-02-19  0:00 ` John Briggs
  1998-02-19  0:00 ` Stephen Leake
  1 sibling, 0 replies; 3+ messages in thread
From: John Briggs @ 1998-02-19  0:00 UTC (permalink / raw)



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




^ permalink raw reply	[flat|nested] 3+ messages in thread

end of thread, other threads:[~1998-02-19  0:00 UTC | newest]

Thread overview: 3+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1998-02-19  0:00 binairy trees jj091849
1998-02-19  0:00 ` John Briggs
1998-02-19  0:00 ` Stephen Leake

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox