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=0.6 required=5.0 tests=BAYES_40,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,2cffe5b7f6441c15
X-Google-Attributes: gid103376,public
From: vaxs09@alpha.tst.tracor.com (John Briggs)
Subject: Re: binairy trees
Date: 1998/02/19
Message-ID: <1998Feb19.172958@alpha.tst.tracor.com>#1/1
X-Deja-AN: 326738644
References: <34EC5F3A.6023@er.uqam.ca>
Organization: Vitro Corporation
Newsgroups: comp.lang.ada
Date: 1998-02-19T00:00:00+00:00
List-Id: <comp.lang.ada>


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