void LinkedList::copy(const LinkedList& other)
{
	Node* temp = other.head;
	if (temp != nullptr)
	{
		++n;
		Node* localTemp = head = new Node(temp->data);
		while (temp->next)
		{
		localTemp->next = new Node(temp->next->data);
		++n;
		temp = temp->next;
		localTemp = localTemp->next;
		}
	}
	else
		head = nullptr;
}




void Queue::copy(const Queue& other)
{
	for (Node* temp = other.head; temp; temp = temp->next)
		addBack(temp->data);