Differences between current version and predecessor to the previous major change of LinkedList.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 6 | Last edited on Sunday, October 26, 2003 7:35:27 am | by AristotlePagaltzis | |
| Older page: | version 2 | Last edited on Wednesday, February 26, 2003 12:43:51 pm | by SamJansen | Revert |
@@ -8,5 +8,9 @@
T data;
!LinkedListNode *next;
};
-[LinkedList]s work by each node merely pointing to the next node in the list, where the last node has a NullPointer. Doubly-linked lists have a previous pointer as well, allowing bi-directional iteration. A circular list has the last node pointing back to the first node. Adding and deleting nodes aren't terribly complex but require a little thinking; you need to store temporary pointers and do a little magic. Most higher level languages have linked list constructs. For example [C++] has the [STL], [Java] has a LinkedList in its class libraries. If you are coding C, however, you might have to write your own.
+[LinkedList]s work by each node merely pointing to the next node in the list, where the last node has a NullPointer. Doubly-linked lists have a previous pointer as well, allowing bi-directional iteration. A circular list has the last node pointing back to the first node. Adding and deleting nodes aren't terribly complex but require a little thinking; you need to store temporary pointers and do a little magic.
+
+
Most higher level languages have linked list constructs. For example [C++] has the [STL], [Java] has a LinkedList in its class libraries. Category:FunctionalProgrammingLanguages almost always have linked lists as built-in datatypes, the linked list is the primary datatype in [LISP]
. If you are coding [
C]
, however, you might have to write your own.
+
+''Note'': Python has a "list" datatype, but it is implemented as an array of pointers, so don't treat it like a linked list -- prepending elements to the head of a Python list one by one is not an efficent thing to do
.
