Форум программистов [Powered by Invision Power Board]

Код

template <class T>
class LIST_UK
    {
public:    
    T info;
  
    LIST_UK <T>  *next;
     LIST_UK <T> *list;    // Указатель на корень
    LIST_UK() { next=NULL; list = NULL; }
    };

template <class T>
class TSIKL:public LIST_UK <T>
    {
    public:
        void insert(T x)
            {
            list = ::insert(list, x);
            }

        void remove()
            {
            list=::remove(list);
            }
        void del_num(int n)
            {
            list=::del_num(list,n);
            }
         
        
          int find(T x)
            {
            if (::find(list, x)) return 1;
            else return 0;
            }

        void show()
            {
            
            ::show(list);
            }
        void sort()
        {
            ::sort(list);
  
        }
        
    };

template <class T>
LIST_UK <T> *find(LIST_UK <T> *t, T x)
    {
    int k=0;
    if(t)
        {
        LIST_UK <T> *cur=t->next;
        do
        { if(x == cur->info)k++;
        cur=cur->next;}
        while(cur!=t->next);
    
        if(k==0)return 0;
        else return t;
}
    else return 0;
    }

template <class T>
LIST_UK <T> *insert(LIST_UK <T> *list, T x)
    {
    LIST_UK <T> *p;
    p=(LIST_UK <T> *)malloc(sizeof(LIST_UK <T>));
    p->info=x;
    if(list){p->next=list->next;
    list->next=p;
    list=p;
    }
    else{list=p; list->next=p;}
    return list;

    }

template <class T>
LIST_UK <T> *remove(LIST_UK <T> *list)
    {
    LIST_UK <T>* p;
    if(list!=0)
    {
        p=list->next;
        if(p==list){list=0;}
        else 
        {
            list->next=p->next;
        delete p;
        }
        }    
        return list;

}

template <class T>
void show( LIST_UK <T> *p )
    {
    
    if (p!=0)
        {
        LIST_UK <T> *cur=p->next;
        do
        { 
            cout<<cur->info;
        cur=cur->next;}
        while(cur!=p->next);
}
    else{return;}
    }

template <class T>
LIST_UK <T> *del_num(LIST_UK <T> *list, int n)
{
  LIST_UK <T> *p=list->next, *q;
  if (n==0) return list=remove(list);
  for(int i=0; i<n; i++)
  {q=p;    p = p->next;}
  if(p==list){list=q;}
  if (p!=0)
  {q->next=p->next;
   delete p;}
  return list;
}