Differences between version 5 and revision by previous author of LinkedList.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 5 | Last edited on Thursday, August 7, 2003 3:40:21 am | by AristotlePagaltzis | Revert |
| Older page: | version 4 | Last edited on Wednesday, February 26, 2003 5:18:52 pm | by GlynWebster | Revert |
@@ -10,7 +10,7 @@
};
[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. FunctionalLanguages 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.
+Most higher level languages have linked list constructs. For example [C++] has the [STL], [Java] has a LinkedList in its class libraries. FunctionalLanguages 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.
