Differences between version 2 and previous revision of LinkedList.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
Newer page: | version 2 | Last edited on Wednesday, February 26, 2003 12:43:51 pm | by SamJansen | Revert |
Older page: | version 1 | Last edited on Wednesday, February 26, 2003 12:42:51 pm | by SamJansen | Revert |
@@ -8,5 +8,5 @@
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. If you are coding C, however, you might have to write your own.