| rdfs:comment
| - A linked list is a list made up of nodes, each of which contains information and points to another node. Using recursion, a linked list can be created, searched from, sorted and deleted. There are many types of linked lists according to its structure: The linked structure allows data to be dynamically added and deleted in constant time, but it can only be accessed sequentially (that is, it does not allow random access).
|
| abstract
| - A linked list is a list made up of nodes, each of which contains information and points to another node. Using recursion, a linked list can be created, searched from, sorted and deleted. There are many types of linked lists according to its structure:
* singly-linked/doubly-linked list - In a doubly-linked list, each node points to the node after it and the node before it. In a singly-linked list, each node points only to the node after it.
* linear (non-circular)/circular list - In a circular list, the last node points to the first node.
* lists with sentinel nodes - Sentinel nodes are sometimes used to simplify the implementation of a linked list. These nodes can occur at the end of the list, and sometimes at the beginning, depending on the implementation. The linked structure allows data to be dynamically added and deleted in constant time, but it can only be accessed sequentially (that is, it does not allow random access).
|