/*
 * Sonny Rajagopalan
 * CISC181-040 (06J), Summer 2006.
 * Linked list testing file 
 */

#include <iostream>
#include "ll.h"

int main()
{
  struct LinkedList ll;

  createANewLinkedList(ll);
  cout << "head is " << ll.head << " and tail is " << ll.tail << endl;

  addToTailOfLinkedList(ll, 1);
  cout << "head is " << ll.head << " and tail is " << ll.tail << endl;
  cout << "After adding key=1:" << endl;
  printLinkedList(ll);
  addToTailOfLinkedList(ll, 2);
  cout << "head is " << ll.head << " and tail is " << ll.tail << endl;
  cout << "After adding key=2:" << endl << endl;
  printLinkedList(ll);
  addToTailOfLinkedList(ll, 3);
  cout << "head is " << ll.head << " and tail is " << ll.tail << endl;
  cout << "After adding key=3:" << endl << endl;
  printLinkedList(ll);
  addToTailOfLinkedList(ll, 53732);
  cout << "head is " << ll.head << " and tail is " << ll.tail << endl;
  cout << "After adding key=53732:" << endl << endl;
  printLinkedList(ll);
  cout << "FINISH: head is " << ll.head << " and tail is " << ll.tail << endl;
}