Skip to main content
Code Review

Return to the linked-list wiki

Insert/Remove is O(n), trim down the exerpts, and remove opinion-based statemebt about random access
Source Link
edit approved Dec 11, 2013 at 16:37
rolfl
edit approved Dec 11, 2013 at 16:37
rolfl
  • 98.1k
  • 17
  • 219
  • 419

A linked list is a data structure in which the elements contain references to the next (and optionally the previous) element. Linked lists offer O(1) insert and removal at any position, O(1) list concatenation, and O(1) access at the front (and optionally back) positions as well as O(1) next element access. Random access has O(N) complexity and is usually unimplemented.

A linked list is a data structure in which the elements contain references to the next (and optionally the previous) element. Linked lists offer O(1) insert and removal at any position, O(1) list concatenation, and O(1) access at the front (and optionally back) positions as well as O(1) next element access. Random access has O(N) complexity and is usually unimplemented.

A linked list is a data structure in which the elements contain references to the next (and optionally the previous) element.

Source Link
palacsint
palacsint
  • 30.4k
  • 9
  • 82
  • 157

A linked list is a data structure in which the elements contain references to the next (and optionally the previous) element. Linked lists offer O(1) insert and removal at any position, O(1) list concatenation, and O(1) access at the front (and optionally back) positions as well as O(1) next element access. Random access has O(N) complexity and is usually unimplemented.