How can this circular linked list coding be implemented to be a linked list ?

[vaithan]

How can this circular linked list coding be implemented to be a linked list ? #include #include #include class Cell { int info; Cell *next; Cell (int i) { info =i; next=this; } Cell( int i, Cell * n) { info=i;next=n; } friend class List; }; class List { Cell *rear; public : void put (int); void push(int); int pop(); int empty() {return rear==rear->next;} List() {rear=new cell (0);} ~List() { while (!empty() ) pop (); } };

[jkgh]

.. and how do you detect circular lists? Hash tables of pointer values is my best guess. Thanks. Al When a man goes on a date he wonders if he is going to get lucky. A woman already knows - Frederick Ryder