Module 3: Linked List

Question 1

is a series of connected
nodes, where each node is a data
structure.

Answer 1

linked list

Question 2

can grow or shrink in

size as the program runs

Answer 2

linked list

Question 3

Insertion and deletion of nodes is

quicker with X than with Y

Answer 3

linked lists

vectors.

Question 4

each node in a linked list contains one or mode members that represent X and also a Y

Answer 4

data

pointer

Question 5

linked list is called “linked” because each
node in the series has a X that points to
the next node in the list.

Answer 5

pointer

Question 6

in declaring a list, what should you do first

Answer 6

declare a data structure that will be

used for the nodes.

Question 7

head pointer is declared as a X

Answer 7

global variable

Question 8

head
is automatically initialized to X, which
indicates that the list is Y

Answer 8

0 (NULL)

empty.