Anonymous user
Linked list: Difference between revisions
m
added whitespace.
(Added note so that no one needs to insult the tasks anymore) |
m (added whitespace.) |
||
| (3 intermediate revisions by 2 users not shown) | |||
Line 2:
In most languages, an implementation of a linked list is given and programmers will likely never need to create their own implementation. Most programmer-defined implementations found here should not be used in programs, but rather they are here to demonstrate language features and to help show how a linked list works.
{{Template:See also lists}}
Here are examples of the two common types of linked lists:
Line 13 ⟶ 16:
* [[Singly-Linked List (element)]]
* [[Singly-Linked List (element insertion)]]
* [[Singly-linked list/Element removal|Singly-Linked List (element removal)]]
* [[Singly-Linked List (traversal)]]
Line 24 ⟶ 27:
* [[Doubly-Linked List (element)]]
* [[Doubly-Linked List (element insertion)]]
* [[Doubly-linked list/Element removal|Doubly-Linked List (element removal)]]
* [[Doubly-Linked List (traversal)]]
| |||