- Forward


Lists
An Introduction


Prof. David Bernstein
James Madison University

Computer Science Department
bernstdh@jmu.edu

Print

Lists
Back SMYC Forward
  • Defined:
    • An ordered collection in which elements can be added, removed, and replaced at any index
  • An Important Implication:
    • The size of a list can change
Endogenous Data Structures
Back SMYC Forward

Singly-Linked Linear

linked_structure_endogenous_single_linear
Endogenous Data Structures (cont.)
Back SMYC Forward

Singly-Linked Circular

linked_structure_endogenous_single_circular
Endogenous Data Structures (cont.)
Back SMYC Forward

Doubly-Linked Linear

linked_structure_endogenous_double_linear
Endogenous Data Structures (cont.)
Back SMYC Forward

Doubly-Linked Circular

linked_structure_endogenous_double_circular
Exogenous Data Structures
Back SMYC Forward

Singly-Linked Linear

linked_structure_exogenous_single_linear
Exogenous Data Structures (cont.)
Back SMYC Forward

Singly-Linked Circular

linked_structure_exogenous_single_circular
Exogenous Data Structures (cont.)
Back SMYC Forward

Doubly-Linked Linear

linked_structure_exogenous_double_linear
Exogenous Data Structures (cont.)
Back SMYC Forward

Doubly-Linked Circular

linked_structure_exogenous_double_circular
There's Always More to Learn
Back -