list.cpp

//jay ashworth and andy zeng

#include "volsort.h"

//list constructor 
List::List() {
    head = nullptr;
    size = 0;
}

//i wasnt exactly sure about the destructor for the linked list so i used code from stack overflow
//https://stackoverflow.com/questions/2265967/writing-a-linkedlist-destructor
//It essentially iterates through the entire list and deletes each node individually.
List::~List() {
    Node* current = head;
    while( current != 0 ) {
        Node* next = current->next;
        delete current;
        current = next;
    }
    head = 0;
}

//adds new element to the front of list
void List::push_front(const std::string &s){
  Node* add = head;
  head = new Node;
  head -> next = add;
  head -> string = s;
  head -> number = stoi(s);
  size++;
}