#include "List.h"

List::List()
{
    head = NULL;
    tail = NULL;
}

List::~List()
{
    // eyðir öllum nodes þar til hann er kominn að NULL og hættir
    Node *node = head;
    while(node != NULL) {
        head = head->next;
        delete node;
        node = head;
    }
    //head = NULL;
    //tail = NULL;
    // ótharfi nuna en naudsynlegt ef thetta er clear fall.

}

void List::headInsert(int value) {

    Node *node = new Node(value, head);
    if(head == NULL) {
        tail = node;
    }
    head = node;


}
void List::tailInsert(int value) {

    if (head == NULL) {
        headInsert(value);
    }
    else {
    tail->next = new Node(value);
    tail = tail->next;
    }
}

int List::headRemove() {

    Node *node = head;
    head = head->next;
    int retVal = node->value;
    delete node;
    return retVal;

}

ostream& operator << (ostream& out, List& lis) {

        for (Node *node = lis.head; node != NULL; node = node->next) {
            out << node->value << " ";
        }
     return out;
     }