SingleLinkedList

//SingleLinkedList
#include <iostream>

using namespace std;


struct Node
{
    int Value;
    Node *Next;
};

class SLL //SLL = SingleLinkedList
{
private:
    Node *head;
    Node *tail;
    int size;
public:
    SLL()
    {
        head = tail = NULL;
        size = 0;
    }
    ~SLL()
    {
        DeleteAll();
    }

    void AddTail(int number)
    {
        Node *tmp = new Node();
        tmp->Next = NULL;
        tmp->Value = number;
        if (head == NULL)
        {
            head = tail = tmp;
        }
        else
        {
            tail->Next = tmp;
            tail = tmp;
        }
        size++;
    }
    int getSize()
    {
        return size;
    }
    void DeleteOne()
    {
        head = head->Next;
    }
    void DeleteAll()
    {
        while (head != NULL)
        {
            DeleteOne();
        }
    }
    void Print()
    {
        Node *tmp = new Node();
        tmp = head;
        while (tmp->Next != NULL)
        {
            cout << tmp->Value << "  ";
            tmp = tmp->Next;
        }
        cout << endl;
    }
};

int main()
{
    //SLL = SingleLinkedList
    cout << "Single Linked List SSL" << endl;
    SLL list;
    for (int i = 0; i < 20; i++)
        list.AddTail(i);
    list.Print();

    cin.get();
    return 0;
}