COMP104CircularLinkedList/Slide6Traverse the listvoid print(NodePtr Rear)(Nodeptr Cur;if(Rear!=NULL)(Cur = Rear->next;dot<"cout<< Cur->dataCur = Cur->next;|while(Cur != Rear->next);cout << endl;701040IRear
COMP104 Circular Linked List / Slide 6 void print(NodePtr Rear){ NodePtr Cur; if(Rear != NULL){ Cur = Rear->next; do{ cout << Cur->data << " "; Cur = Cur->next; }while(Cur != Rear->next); cout << endl; } } Traverse the list Rear 10 20 40 55 70
COMP104CircularLinkedList/Slide7Insert NodeInsert into an empty listNotePtr New = new Node;New->data =10;Rear =New;Rear->next = Rear;10New Rear
COMP104 Circular Linked List / Slide 7 Insert Node Insert into an empty list Rear 10 New NotePtr New = new Node; New->data = 10; Rear = New; Rear->next = Rear;