Miscellany

void List::AddAtRear(Node &v)
{
        Node * nPtr;
        if(!IsFull())
        {
            if(front==0)
            {
                 AddAtFront(v);
                 return;
            }
            else
            {
                 Node * temp;
                 temp = FindNode(front, 0);
                 if(temp == 0)
                 {
                     return;
                 }
                 nPtr = new Node();
                 temp->next = nPtr;
				 nPtr->next = NULL;
                 nPtr->data = v.data;
            }
        }
}

Node * List::FindNode(Node * start, Node * end)
{
        Node * temp = start;
        Node * test;
        while(temp != end)
        {
                test = temp->next;
                if(test == end)
                {
                        return temp;
                }
                else
                {
                        temp = test;
                }
        }
        
        return end;
}