[C++/템플릿으로 만드는 자료구조] 단순원형연결리스트(Circular Linked List)

단순원형연결리스트의 소스입니다. 사용시에는 iostream을 인클루드 시켜야합니다.

template<typename Type>
class Node
{
public:
    Type VALUE;
    Node<Type> *Link;
};
 
template<typename Type>
class List
{
private:
    Node<Type> *header;
    Node<Type> *tailer;
public:
    List();
    ~List();
    void Add_First(Type Item);
    void Add(int Position, Type Item);
    Type Delete(int Position);
    void Replace(int Position, Type Item);
    void Find(Type Item);
    void Get_Entry(int Position);
    void Get_Length();
    bool Is_Empty();
    void printing();
};
 
template<typename Type>
List<Type>::List()
{
    this->header = NULL;
    this->tailer = NULL;
}
 
template<typename Type>
List<Type>::~List()
{
 
}
 
template<typename Type>
void List<Type>::Add_First(Type Item)
{
    Node<Type> *New = new Node<Type>;//새로 값을 넣을 곳
    if (this->header == NULL)
    {
        this->header = New;
        this->tailer = New;
        New->VALUE = Item;
        New->Link = this->tailer;
        return;
    }
    if (this->header != NULL)
    {
        New->Link = this->header;
        New->VALUE = Item;
        this->header = New;
        this->tailer->Link = this->header;
        return;
    }
}
 
template<typename Type>
void List<Type>::Add(int Position, Type Item)
{
    if (Position == 1 || this->header == NULL)
    {
        this->Add_First(Item);
        return;
    }
    int pos = 1;
    Node<Type> *Cur = this->header;
    Node<Type> *New = new Node<Type>;
    while (pos > Position - 1)
    {
        Cur = Cur->Link;
        pos++;
    }
    New->VALUE = Item;
    New->Link = Cur->Link;
    Cur->Link = New;
}
 
template<typename Type>
Type List<Type>::Delete(int Position)
{
    if (this->Is_Empty())
    {
        return 0;
    }
    int pos = 1;
    int Retuen_Value;
    Node<Type> *Temp = NULL;
    Node<Type> *Cur = this->header;
    while (pos < Position)
    {
        if (Cur->Link == NULL)
        {
            std::cout << "NO data int this Position" << std::endl;
            return 0;
        }
        if (pos == Position - 1)
            Temp = Cur;
        Cur = Cur->Link;
        pos++;
    }
    Retuen_Value = Cur->VALUE;
    Temp->Link = Cur->Link;
    delete(Cur);
    return Retuen_Value;
}
 
template<typename Type>
void List<Type>::Replace(int Position, Type Item)
{
    int pos = 1;
    Node<Type> *Cur = this->header;
    while (pos < Position)
    {
        Cur = Cur->Link;
        pos++;
    }
    Cur->VALUE = Item;
}
 
template<typename Type>
void List<Type>::Find(Type Item)
{
    Node<Type> *Cur = this->header;
    int i = 1;
    while (Cur != this->header)
    {
        if (Cur->VALUE == Item)
        {
            std::cout << Item << " is in " << i << "(th) Node" << std::endl;
        }
        i++;
        Cur = Cur->Link;
    }
    if (Cur == NULL)
    {
        std::cout << Item << " is not in this List" << std::endl;
    }
}
 
template<typename Type>
void List<Type>::Get_Entry(int Position)
{
    int pos = 1;
    Node<Type> *Cur = this->header;
    while (pos < Position)
    {
        Cur = Cur->Link;
        pos++;
    }
    std::cout << Cur->VALUE << " is in " << Position << "(th) node" << std::endl;
}
 
template<typename Type>
void List<Type>::Get_Length()
{
    Node<Type> *Cur = this->header;
    int i = 1;
    while (Cur != this->header)
    {
        i++;
        Cur = Cur->Link;
    }
    std::cout << "this List has " << i << " Nodes" << std::endl;
}
 
template<typename Type>
bool List<Type>::Is_Empty()
{
    if (this->header == NULL)
    {
        std::cout << "This List is empty" << std::endl;
        return true;
    }
    std::cout << "This List is not empty" << std::endl;
    return false;
}
 
template<typename Type>
void List<Type>::printing()
{
    Node<Type> *Cur = this->header;
    std::cout << Cur->VALUE << " -> " << std::endl;
    Cur = Cur->Link;
    while (Cur != this->header)
    {
        std::cout << Cur->VALUE << " -> " << std::endl;
        Cur = Cur->Link;
    }
    std::cout << std::endl;
}

같이보기

2015/11/07 - [Programming/자료구조] - [C로 만드는 자료구조]리스트(List)- 단순 원형 연결 리스트