Quiz 3

Question 1

In a linked list:

What components do you need for the print function?

Answer 1

• Create a pointer to root
• Check if the pointer is null
• Check if next is NULL, print
• loop until null and print pointer while setting pointer to next

Question 2

In a linked list:

What components do you need in a add function?

Answer 2

• Set the an object pointer to the parameter (e.g. newnode)
• Set newnode’s next to NULL
• Create pointer to root
• Check if root is null else
• Iterate until en of list and set root to new node

Question 3

In a linked list:

What components do you need in a delete function?

Answer 3

• Create pointer to root
• Check if root is null
• Check if next is null
• Create temp node set to to the pointer
  else {
  mynode* tmp= 0;

while (ptr->GetNext() != NULL{
tmp= ptr;
ptr= ptr->GetNext();}
delete ptr;
tmp->SetNext(NULL);
return;}}

Question 4

In a linked list:

What components do you need in a length function?

Answer 4

• Pointer to root
• Check if null
• Check if next is null
• Iterate until the end
• Increment counter