//n - количество элементов в цилкическом списке
public void PrintCLL(int n)
{
Node_CLL ptr = head;
int k = 0;
do
{
Console.Write(ptr.data + " ");
k++;
ptr = ptr.next;
}while (k != n + 1);
Console.WriteLine();
}
public void Insert(int data)
{
Node_CLL curr = new Node_CLL(data);
Node_CLL ptr = head;
curr.next = head;
if (head != null)
{
while (ptr.next != head)
{
ptr = ptr.next;
}
ptr.next = curr;
}
else
{
curr.next = curr;
}
head = curr;
}
public CycledLinkedList()
{
head = null;
count = 0;
}
