#include "doubly-linked.h"

List::List(){
	first = NULL;
}

List::~List() {
}

void List::insert(int n) {
	Node* new_node = new Node();

	new_node -> val = n;

	new_node -> prev = NULL;

	new_node -> next = first;

	if((first) != NULL){
		(first) -> prev = new_node;
	}
	(first) = new_node;

}

void List::reverse() {
	Node *temp = NULL;
	Node *current = first;

    while (current != NULL)
    {
        temp = current->prev;
        current->prev = current->next;
        current->next = temp;
        current = current->prev;
    }

    if(temp != NULL )
        first = temp->prev;


}

void List::print() {
	Node* node;
	while(node != NULL){
		cout << node->val << " ";
		node = node -> next;
	}
}