← Back to SIT102
SIT102 High Distinction
Linked Lists
An implementation of the linked list data structure in C++. Demonstrates understanding of dynamic memory allocation, pointer manipulation, and complex data structure design for efficient data management.
Key Features
- Node creation and linking
- Pointer manipulation
- Dynamic memory allocation
- Insertion and deletion operations
- Traversal algorithms
Technical Stack
C++
Skills Demonstrated
Pointer manipulationDynamic data structuresMemory managementAlgorithm design
Request Evidence by Email →