Circular Singly Linked List

circularSinglyLinkedList.cpp

//Milad Abbasi
//06-07-2018
//Circular Singly Linked List

#include <iostream>
using namespace std;

struct Node
{
	int data;
	Node *next;
};

class CSList
{
	Node *last;
	Node *tmp;

	void createNode(int value)
	{
		tmp = new Node;
		tmp->data = value;
		last = tmp;
		tmp->next = last;
	}

public:
	CSList()
	{
		last = NULL;
	}

	void insertStart(int value)
	{
		if(isEmpty())
			createNode(value);
		else
		{
			tmp = new Node;
			tmp->data = value;
			tmp->next = last->next;
			last->next = tmp;
		}
	}

	void insertEnd(int value)
	{
		if(isEmpty())
			createNode(value);
		else
		{
			tmp = new Node;
			tmp->data = value;
			tmp->next = last->next;
			last->next = tmp;
			last = tmp;
		}
	}

	void insertAfter(int pos, int value)
	{
		if(isEmpty())
			createNode(value);
		else
		{
			tmp = new Node;
			tmp->data = value;
			Node *current = new Node;
			current = last->next;
			for(int i = 1; i < pos; i++)
				current = current->next;

			tmp->next = current->next;
			current->next = tmp;
		}
	}

	void deleteStart()
	{
		if(isEmpty())
		{
			cout<<"List is empty";
			return;
		}
		tmp = new Node;
		tmp = last->next;
		last->next = tmp->next;
		delete tmp;
	}

	void deleteEnd()
	{
		if(isEmpty())
		{
			cout<<"List is empty";
			return;
		}
		Node *current = new Node;
		current = last->next;
		tmp = last;
		while(current->next != last)
			current = current->next;

		current->next = last->next;
		last = current;
		delete tmp;
	}

	void deletePosition(int pos)
	{
		if(isEmpty())
		{
			cout<<"List is empty";
			return;
		}
		tmp = last;
		Node *current, *previous;
		current = last->next;
		for(int i = 1; i < pos; i++)
		{
			previous = current;
			current = current->next;
		}

		previous->next = current->next;

	}

	bool isEmpty()
	{
		return last == NULL;
	}

	void print()
	{
		tmp = new Node;
		tmp = last->next;
		while(tmp != last)
		{
			cout<<tmp->data<<"\t";
			tmp = tmp->next;
		}
		cout<<tmp->data<<endl;
	}
};