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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII
X-Google-Thread: 103376,5d80f40bdd51947e
X-Google-Attributes: gid103376,public
From: John Cupak <John_J_Cupak@res.raytheon.com>
Subject: Re: binary tree and files
Date: 2000/11/03
Message-ID: <3A02F502.9956CB25@res.raytheon.com>#1/1
X-Deja-AN: 689297114
Content-Transfer-Encoding: 8bit
References: <8tuk7l$aq5$1@wanadoo.fr> <8tul32$c3p$1@wanadoo.fr>
 <3A02DF9B.2269@global2000.net> <8tuq67$lqj$1@wanadoo.fr>
X-Accept-Language: en
Content-Type: text/plain; charset=iso-8859-1
X-Complaints-To: usenet@swl.msd.ray.com
X-Trace: swlmail.msd.ray.com 973272332 31921 138.127.184.129 (3 Nov 2000
 17:25:32 GMT)
Organization: Raytheon Company
Mime-Version: 1.0
NNTP-Posting-Date: 3 Nov 2000 17:25:32 GMT
Newsgroups: comp.lang.ada
Date: 2000-11-03T17:25:32+00:00
List-Id: <comp.lang.ada>

Check out Streams in Cohen's "Ada as a Second Language, 2nd ed." text.

John

Franck wrote:

> Arthur G. Duncan a �crit dans le message <3A02DF9B.2269@global2000.net>...
> >Franck wrote:
> >
> >  ... question on how to save and restore a binary tree of the
> >      form:
> >
> >> type T_node;
> >> type Pt_tree is access T_Node;
> >>
> >> type T_Node is record
> >>    name : T_name;
> >>    G, D : Pt_tree;
> >> end record;
> >>
> >
> >If it is, indeed, a tree (no cycles), you can simply write it out
> >as a set of nested tuples (LISP list notation is as good a form
> >as any).
> >
> >If there are cycles (or the tree is reentrant and you want to save
> >disk space) you can label the nodes and write out label references
> >wherever you have a pointer in the original data structure.
> >
> >Hope this helps,
> >
> >- Art Duncan
> >  aduncan@global2000.net
>
> thanks for the help Duncan,
> but i'm new to Ada and recursivity, and i don't understand all you speek
> about ;o)
> what is a set of nested tuples??
> there is no cycle i think in my program
> it s to make a genealogic tree,like this :
>
> father                      father has 2 children : child1 and child2
>      /   \
>     /      \
> null       child1                child1 has no child
>               /        \
>              /           \
>         child2      null           child2 has 2 children : little child1 and
> little child2
>           /    \
>         /        \
>     null        little child1             little child1 has no child (right)
> and one brother(left)
>                     /             \
>                   /                 \
>             little child2     null          little child2 has no other
> brother and no child
>                /           \
>              /               \
>           null            null
>
> i can easily save that in a files with recursive procedure, but i don't see
> how to load it from files
>
> still in need of help ;o)
>
> Franck