list main2.cpp

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

int main()
{
    List l;

    l.appendNode(6);
    l.appendNode(19);
    l.appendNode(21);

    //Display initial values
    cout << "Here are the initial values:\n";
    l.displayList();
    cout << endl;

    //Delete middle node
    cout << "Now deleting the node in the middle.\n";
    l.deleteNode(19);

    //Display the list
    cout << "Here are the nodes left:\n";
    l.displayList();
    cout << endl;

    //Insert new middle node
    cout << "Inserting a new node in the middle:\n";
    l.insertNode(11);

    //Display the list
    cout << "Here is the new list:\n";
    l.displayList();
    cout << endl;

    //Using insertSpecificNode to put a node in a place that's not numerical order
    cout << "Inserting a new node between 6 and 11:\n";
    l.insertSpecificNode(74, 1);
    cout << endl;

    //Display the list
    cout << "Here is the new list:\n";
    l.displayList();
    cout << endl;

    //Using a high value to show that insertSpecificNode puts the node at the end of the list if the place requested does not exist
    cout << "Inserting a new node at the end of the list:\n";
    l.insertSpecificNode(2, 9999);
    cout << endl;

    //Display the list
    cout << "Here is the new list:\n";
    l.displayList();
    cout << endl;

    return 0;
}