[Tutor] lists [Twisted Linked Lists]

Victor R. Cardona vcardon@siue.edu
Wed, 24 Apr 2002 15:39:53 -0500


--bp/iNruPH9dso1Pn
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable

On Wed, Apr 24, 2002 at 07:02:00PM -0700, Danny Yoo wrote:
<Code snipped...>
> The key is to understand that a linked list only requires a way of
> "referring" to another element.  As long as we can conceptually refer to
> an element, we have enough machinery to build linked lists, and being able
> to refer to an list item by index is just enough to get things rolling:

<More code snipped...>
> So it's possible to do linked lists even without pointers.  The code above
> doesn't use the trick that Alan mentioned, but it shouldn't be hard to
> change it to optimize finding a new node to cons()truct.
=20
My mistake. Although, I still can't think of a reason why you would want
to go out of your way to implement a linked list in Python.

Thanks,
Victor

--bp/iNruPH9dso1Pn
Content-Type: application/pgp-signature
Content-Disposition: inline

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.6 (GNU/Linux)
Comment: For info see http://www.gnupg.org

iD8DBQE8xxgYZU/bSegbOhwRAkFJAKCseAiFBj2zclVC1JLWMtmTYSvPvwCfR68T
CRqg+jr4/NG9nDkP5qVYx5s=
=AoTv
-----END PGP SIGNATURE-----

--bp/iNruPH9dso1Pn--