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.2 required=5.0 tests=BAYES_00,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC 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: Stephen Leake <Stephen.Leake@gsfc.nasa.gov>
Subject: Re: binairy trees
Date: 1998/02/19
Message-ID: <34EC6CE7.45DA@gsfc.nasa.gov>#1/1
X-Deja-AN: 326655594
Content-Transfer-Encoding: 7bit
References: <34EC5F3A.6023@er.uqam.ca>
Content-Type: text/plain; charset=us-ascii
Organization: NASA Goddard Space Flight Center -- Greenbelt, Maryland USA
Mime-Version: 1.0
Reply-To: Stephen.Leake@gsfc.nasa.gov
Newsgroups: comp.lang.ada
Date: 1998-02-19T00:00:00+00:00
List-Id: <comp.lang.ada>


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