Linked Lists

Question 1

What does a linked data structure consist of?

Answer 1

Each item points to another item.

Question 2

Describe a singly linked list.

Answer 2

Each item points to the next item.

Question 3

Describe a doubly linked list.

Answer 3

Each item points to the next item and to the previous item.

Question 4

What are the advantages of a linked list.

Answer 4

Items don’t have to be stored in consecutive memory locations, so we can insert and delete items without shifting data.

Linked lists can grow and shrink dynamically.

Question 5

What’s a node.

Answer 5

A linked list is a sequence of items called nodes.

A node in a singly linked list consists of two fields (data and pointer).