For some reason, I keep getting an "identifier not found" error whenever I try to use appendNode(). In addition, I keep getting an error that tells me I'm missing ";" before "using" which doesn't make any sense.
header file
#ifndef INTEGERLIST_H
#define INTEGERLIST_H
#include <iostream>
using namespace std;
class IntegerList
{
private:
    struct ListNode
    {
        int value;
        struct ListNode *next;
    };
    ListNode *head;
public:
    IntegerList()
    {
        head = NULL;
    }
    ~IntegerList();
    void appendNode(int);
    void insertNode(int);
    void deleteNode(int);
    void printList() const;
}
#endif
Implementation file
#include "IntegerList.h"
#include <iostream>
using namespace std;
void IntegerList::appendNode(int num)
{
    ListNode *newNode;
    ListNode *nodePtr;
    //new allocation
    newNode = new ListNode;
    newNode->value = num;
    newNode->next = NULL;
    if (!head)
        head = newNode;
    else
    {
        nodePtr = head;
        while(nodePtr->next)
            nodePtr = nodePtr->next;
        nodePtr->next = newNode;
    }
}
void IntegerList::insertNode(int num)
{
    ListNode *newNode;
    ListNode *nodePtr;
    ListNode *previousNode = NULL;
    newNode = new ListNode;
    newNode->value = num;
    if(!head)
    {
        head = newNode;
        newNode->next = NULL;
    }
    else
    {
        nodePtr = head;
        previousNode = NULL;
        while(nodePtr != NULL && nodePtr->value < num)
        {
            previousNode = nodePtr;
            nodePtr = nodePtr->next;
        }
        if(previousNode == NULL)
        {
            head = newNode;
            newNode->next = nodePtr;
        }
        else
        {
            previousNode->next = newNode;
            newNode->next = nodePtr;
        }
    }
}
void IntegerList::deleteNode(int num)
{
    ListNode *nodePtr;
    ListNode *previousNode;
    if(!head)
        return;
    if(head->value == num)
    {
        nodePtr = head->next;
        delete head;
        head = nodePtr;
    }
    else
    {
        nodePtr = head;
        while(nodePtr != NULL && nodePtr->value != num)
        {
            previousNode = nodePtr;
            nodePtr = nodePtr->next;
        }
        if(nodePtr)
        {
            previousNode->next = nodePtr->next;
            delete nodePtr;
        }
    }
}
void IntegerList::printList() const
{
    ListNode *nodePtr;
    nodePtr = head;
    while(nodePtr)
    {
        cout << nodePtr->value << endl;
        nodePtr = nodePtr->next;
    }
}
 
     
     
     
     
    