Linked List

Question 1

What kind of structure is a linked list?

Answer 1

A dynamic data structure

Question 2

What is an element in a list called?

Answer 2

Node

Question 3

What things does a node store?

Answer 3

The data relating to the element

A pointer to the next node

Question 4

Define traversing

Answer 4

To work your way systematically through the list

Question 5

How do you traverse a list?

Answer 5

Start at the first node and follow each link until you reach the last node

Question 6

can a linked list be ordered?

Answer 6

A linked list can be ordered or unordered

Question 7

Where can you add a new node to an unordered list?

Answer 7

To the beginning or end of list

Question 8

Is it more efficient to add nodes to the end of an unordered list?

Answer 8

No as you have to trans verse the list to find the last element

Question 9

Steps for adding a new node to an unordered list

Answer 9

Create a new node
Set the pointer of the node to the value of the head pointer
Set the head pointer to the new node

Question 10

Define the process for inserting a new element into a list ordered numerically

Answer 10

Create the new node
Traverse the list until you reach the node which has a value greater than the value of the new node
Set the value of the next pointer of the new node to the value of the next pointer of the previous node
Set the value of the next pointer of the previous node to point to the new node