From: fjh@murlibobo.cs.mu.OZ.AU (Fergus Henderson)
Subject: Re: How: Remove end of Linked List w/ tail pointer?
Date: 1997/11/30
Date: 1997-11-30T00:00:00+00:00 [thread overview]
Message-ID: <65sa0s$qng@mulga.cs.mu.OZ.AU> (raw)
In-Reply-To: 65s8gp$pdc@bgtnsc03.worldnet.att.net
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.
next prev parent reply other threads:[~1997-11-30 0:00 UTC|newest]
Thread overview: 3+ messages / expand[flat|nested] mbox.gz Atom feed top
1997-11-30 0:00 How: Remove end of Linked List w/ tail pointer? byrner
1997-11-30 0:00 ` Fergus Henderson [this message]
1997-11-30 0:00 ` Matthew Heaney
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox