quote: Hello.
I've got a great linked list class that is Template based.
the code is very simple and there is also a demo program.
I can give it to anyone, just ask for it from:
preshel@mailcity.com

I prefer to use STL containers/iterators... It saves from re-inventing the wheel.. Although implementing one yourself is always a good excercise..

----------
Mail me, Drago's OpenGL Website

Edited by - drago on November 3, 2000 8:28:13 PM

If you know how to make a linked list, They´re useful, in a list of guys or items or something.

Links to the prior element in a list are required if you want to add and remove from the head and tail of the list, at least efficiently. Remember that this is only really an issue if you have a large list. If you have lots of little lists, it is best to go with a singly linked list, where you don''t really need the overhead of the extra pointer.
(btw, BSP can be implemented by binary trees, which in turn must be implemented by an underlying ds, most likely a linked list).
Todd.