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,b7dc7082d345b1e1 X-Google-Attributes: gid103376,public From: Jeff Carter Subject: Re: package dependence question Date: 2000/05/29 Message-ID: <393296FB.78AA031D@acm.org>#1/1 X-Deja-AN: 628672115 Content-Transfer-Encoding: 7bit References: <8gt19i$1cm8@r02n01.cac.psu.edu> X-Accept-Language: en Content-Type: text/plain; charset=us-ascii X-Complaints-To: abuse@earthlink.net X-Trace: newsread1.prod.itd.earthlink.net 959620401 63.10.52.69 (Mon, 29 May 2000 10:13:21 PDT) Organization: EarthLink Inc. -- http://www.EarthLink.net MIME-Version: 1.0 Reply-To: jrcarter@acm.org NNTP-Posting-Date: Mon, 29 May 2000 10:13:21 PDT Newsgroups: comp.lang.ada Date: 2000-05-29T00:00:00+00:00 List-Id: Carl Banks wrote: > > Okay, when I program, I like to construct large, dynamic tree > structures. I like my trees to be traversible in any direction, so if > you're sitting on a node, you can access its parent or any of its > branches. > > So let's say that a particular tree has a different type of node at > each level. For example, type A is the root of the tree. Its > branches are of type B. B's branches are of type C, and so on. Then this isn't really a tree; it's a hierarchy. Trees have the same type everywhere a value is stored. Hierarchies are shaped like trees, but are used differently. I often see people using trees when other structures would be better. There are certainly ways to achieve what you want, but without a better understanding of what you are trying to use this structure to achieve I can't tell which, if any, would be appropriate for your needs. -- Jeff Carter "Your mother was a hamster and your father smelt of elderberries." Monty Python & the Holy Grail