Conestoga College - PROG 71985
Assignment 4 – W2025
Assignment 4More Features for our Unidirectional Linked List
In the lecture we have completed the following implementations for the unidirectional linked list:
Definition of the list element structure
Create and delete a list
Print the list contents
Add an element to the list at any given index, with index-out-of-bound error check
Search list by index and by contents
Members only
Keep reading this lesson
You've reached the end of the free preview. Unlock the rest of this lesson plus 3 more lessons in Conestoga College - PROG 71985.
- Unlimited coding questions
- Unlimited access to all classroom material
- Weekly live call for questions and guidance
- 3,000 AI tutor tokens / month
- Personal SQL database (3 MB)
- Progress tracking
Cancel any time.