Linked Lists

Question 1

What are Linked Lists?

Answer 1

provides dynamism that a simple array lacks, allowing efficient insertion and deletion

elements (nodes) are linked using pointers

Question 2

What do Nodes contain?

Answer 2

data - actual value
pointer / reference - points to the next node (NULL if last node)

Question 3

Types of Linked Lists

Answer 3

Singly Linked List - nodes have a single pointer pointing to the next node

Doubly Linked List - nodes have two pointers, one pointing to the next node and one to the previous node

Circular Linked List - last node points back to the first node

Question 4

What is the time complexity of traversing Linked Lists?

Answer 4

O(n) - linear

Question 5

What kind of item is a Linked List item?

Answer 5

structured item that’s self referential

Question 6

What happens if an item