Project Description

In this project, my goal was to create my own implementation of STL's doubly-linked list. It is created using generics so it is not type specific. Additionally, I included an iterator to to iterate over the list.

Overview

A generic doubly linked list. My implementation contains the normal methods such as: inserting, adding (front and back), removing (front and back) and clearing. I added some additional methods such as swap, sort (using bubble-sort algorithm). I also added the ability to push back multiple items. Additionally I used a custom override of the new and delete keywords to keep track of my memory allocations ensuring there were no leaks.