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.1 required=5.0 tests=BAYES_05,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,89a10de5b2ea87d7 X-Google-Attributes: gid103376,public From: matthew_heaney@acm.org (Matthew Heaney) Subject: Re: generic binary tree in ada 83 Date: 1998/04/28 Message-ID: #1/1 X-Deja-AN: 348601858 Content-Transfer-Encoding: 8bit References: <35461333.6DFB@westcott.force9.co.uk> Content-Type: text/plain; charset=ISO-8859-1 Organization: Network Intensive Mime-Version: 1.0 Newsgroups: comp.lang.ada Date: 1998-04-28T00:00:00+00:00 List-Id: In article <35461333.6DFB@westcott.force9.co.uk>, karen westcott wrote: Could you please help me with writting a binary tree that allows generic data. I have got one to work that hold a single character, but can't get modify it to work with generics. BTW, I am writting in ADA 83 NOT 95. Code for this is documented in Grady Booch's data structures book (which was Ada 83).