LinkedList 구현.

#include <iostream>
using namespace std;
 
class MyNode
{
private:
    MyNode* link;
    int data;
public:
    MyNode(int n) : data(n), link(NULL)    {}
    ~MyNode() {}
    MyNode* getLink()
    {
        return link;
    }
    void setLink(MyNode* node)
    {
        if (node != NULL)
        {
            link = node;
        }
    }
    
    void insertNext(MyNode* next)
    {
        if (next != NULL)
        {
            next->setLink(link);
            link = next;
        }
    }
    MyNode* removeNext()
    {
        MyNode* next = link;
        if(next != NULL)
            link = next->getLink();
        return next;
    }
    bool hasData(int n)
    {
        return data == n;
    }
    void display()
    {
        cout << data << " ";
    }
};
 
#include "MyNode.h"
 
class MyLinkedList
{
private:
    MyNode head;
public:
    MyLinkedList() : head(0) {}
    ~MyLinkedList() { clear(); }
    void insert(int pos, MyNode* node)
    {
        MyNode* prev = getElement(pos - 1);
        if (prev != NULL)
        {
            node->setLink(prev->getLink());
            prev->setLink(node);
        }
    }
    MyNode* remove(int pos)
    {
        MyNode* prev = getElement(pos - 1);
        if (prev != NULL)
        {
            prev->removeNext();
        }
    }
    MyNode* getElement(int pos)
    {
        MyNode* node = &head;
        for (int i = -1; i < pos; i++, node = node->getLink())
        {
            if (node != NULL)
                return node;
            else
                break;
        }            
    }
    bool isEmpty()
    {
        return head.getLink() == NULL;
    }
    MyNode* find(int n)
    {
        for (MyNode* p = head.getLink(); p != NULL; p = p->getLink())
        {
            if (p->hasData(n))
                return p;
            else
                return NULL;
        }
    }
    void replace(int pos, MyNode* node)
    {
        MyNode* prev = getElement(pos - 1);
        if (prev != NULL)
        {
            delete prev->removeNext();
            prev->insertNext(node);
        }
    }
    int size()
    {
        int count = 0;
        for (MyNode* p = head.getLink(); p != NULL; p = p->getLink())
        {
            count++;
        }
        return count;
    }
    void clear()
    {
        while (!isEmpty())
        {
            remove(0);
        }
    }
    void display()
    {
        cout << "전체 리스트 : ";
        for (MyNode* p = head.getLink(); p != NULL; p = p->getLink())
        {
            p->display();
        }
        cout << "\n";
    }
};