Singly linked list structure in Data Structures Theory - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a singly linked list?

A singly linked list is a collection of nodes where each node contains data and a reference (or link) to the next node in the sequence. It allows sequential access from the first node to the last.

beginner

What are the main parts of a node in a singly linked list?

Each node has two parts: data, which stores the value, and next, which is a reference to the next node in the list or null if it is the last node.

beginner

How do you traverse a singly linked list?

Start at the first node (called the head), then follow each node's next reference until you reach a node whose next is null, which means the end of the list.

intermediate

What is the difference between a singly linked list and a doubly linked list?

A singly linked list nodes have one link to the next node only, while doubly linked list nodes have two links: one to the next node and one to the previous node, allowing backward traversal.

intermediate

Why might you choose a singly linked list over an array?

A singly linked list allows easy insertion and deletion of nodes without shifting elements, and it can grow or shrink dynamically without needing a fixed size like arrays.

What does each node in a singly linked list contain?

A Data and references to next and previous nodes

B Data and a reference to the next node

C Only data

D Only a reference to the next node

Each node contains data and a reference (link) to the next node only.

How do you know when you have reached the end of a singly linked list?

A When the node points back to the head

B When the data is null

C When the next reference is null

D When the previous reference is null

The last node's next reference is null, indicating the end of the list.

Which operation is easier in a singly linked list compared to an array?

A Sorting the elements

B Accessing an element by index

C Random access

D Inserting a new element in the middle

Inserting in the middle is easier because you only change links without shifting elements.

What is the first node in a singly linked list called?

A Head

B Tail

C Root

D Start

The first node is called the head.

Can you traverse a singly linked list backwards easily?

A No, because nodes only link forward

B Yes, by following previous links

C Yes, by reversing the data

D No, because it has no links

Singly linked lists only have links to the next node, so backward traversal is not straightforward.

Explain the structure of a singly linked list and how nodes are connected.

Think about how each node points to the next one.

Describe the advantages of using a singly linked list compared to an array.

Consider how adding or removing elements works.