Final answer:
A singly linked list was implemented for the Lab 4 submission.
Step-by-step explanation:
The type of linked list that was implemented as part of the Lab 4 submission was a singly linked list.
A singly linked list is a type of linked list where each node in the list contains a reference to the next node. This allows for efficient insertion and removal of elements from the list, but accessing elements in the middle of the list requires traversing the list from the beginning.
For example, if the list contains the elements A, B, C, and D, the nodes in the singly linked list would be set up as follows:
Node A: Value = A, Next = B
- Node B: Value = B, Next = C
- Node C: Value = C, Next = D
- Node D: Value = D, Next = null (end of the list)