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-7-bit
X-Google-Thread: 108717,3bf7aedb3a3132d4,start
X-Google-Attributes: gid108717,public
X-Google-Thread: 103376,ccd10064619f1aa
X-Google-Attributes: gid103376,public
From: fjh@murlibobo.cs.mu.OZ.AU (Fergus Henderson)
Subject: Re: How: Remove end of Linked List w/ tail pointer?
Date: 1997/11/30
Message-ID: <65sa0s$qng@mulga.cs.mu.OZ.AU>#1/1
X-Deja-AN: 293939870
References: <65s8gp$pdc@bgtnsc03.worldnet.att.net>
Followup-To: comp.programming
Organization: Comp Sci, University of Melbourne
Newsgroups: comp.lang.ada,comp.programming
Date: 1997-11-30T00:00:00+00:00
List-Id: <comp.lang.ada>


byrner <byrner@db.erau.edu> writes:

> Does anybody know of a way to make the TAIL pointer point to the
> previous node in the linked list structure defined below without
> starting at the HEAD and performing a loop to search through the entire
> list?

Well, you could always try using doubly-linked lists.

[P.S.  This is more of an algorithms question than an Ada question,
so I have redirected followups to comp.programming.]

--
Fergus Henderson <fjh@cs.mu.oz.au>   |  "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh>   |  of excellence is a lethal habit"
PGP: finger fjh@128.250.37.3         |     -- the last words of T. S. Garp.