#include <iostream>
#include "LList.2.h"
using namespace std;

void LList::insert(int i){
    
    //insert new node into empty list
    //cout << "inside insert, i is " << i << endl;
    Node * temp = head;
    head = new Node;
    head->data = i;
    head->next = temp;

    return;
}