Skip to Main Content
| Brooklyn College Library & Academic IT |CISC Department

CISC 3130 Data Structures: Linked Lists

Professor Chuang Spring 2020 OER

Introduction

Definition: A list implemented by each item having a link to the next item.

Also known as singly linked list. Other forms exist such as doubly linked list, double ended linked list, sorted linked list. 

 

Bibliography: 

Black, Paul E. (2019-10-1). Pieterse, Vreda; Black, Paul E. (eds.). "linked list". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology. Retrieved from: https://xlinux.nist.gov/dads/HTML/linkedList.html

Parlante, Nick. (2004-04-12). Linked List Basics . Retrieved from: http://cslibrary.stanford.edu/103/

Concept

A linked list is made of a node (or link) and a pointer to the next node.

 

A linked list begins with a head, or first. It's kind of like a train, where you can add more nodes. The linked list keeps track of the pointer to the first node. 

Java Implementation

Designing the Linked List from Nodes

Creative Commons License NC SA 4.0 icon This OER resource is released under Creative Commons Attribution-Non Commercial-ShareAlike 4.0 International License. It was made for the Spring 2020 semester by Professor Katherine Chuang on Data Structures at Brooklyn College, Department of Computer and Information Science.