Presentation on circular linked list
Transcript of Presentation on circular linked list
![Page 1: Presentation on circular linked list](https://reader034.fdocuments.in/reader034/viewer/2022042610/58a81fec1a28ab4d148b5f61/html5/thumbnails/1.jpg)
Submitted to -
Mrs. Rupali Mam.
PRESENTATION ON TRAVERSE A
CIRCULAR LINKED LIST
Submitted by -Mehakdeep Singh.
![Page 2: Presentation on circular linked list](https://reader034.fdocuments.in/reader034/viewer/2022042610/58a81fec1a28ab4d148b5f61/html5/thumbnails/2.jpg)
A header linked list is a linked list which always contains a special node, called the header node , at beginning of the list.
A Circular header list is a header list where the last node points back to the header node.
Definition of Linked List and Circular header.
![Page 3: Presentation on circular linked list](https://reader034.fdocuments.in/reader034/viewer/2022042610/58a81fec1a28ab4d148b5f61/html5/thumbnails/3.jpg)
Algorithm :-Let LIST be a circular header list in memory. This algorithm traverses List , applying an operation PROCESS to each node of LIST.
1. Set PTR:=LINK[START]. [Initializes the pointer PTR .]
2. Repeat steps 3 and 4 while PTR≠START:
3. Apply PROCESS to INFO[PTR].4. Set PTR := LINK[PTR]. [PTR now points
to the next node.] [End of Step 2 loop.]5. Exit .
![Page 4: Presentation on circular linked list](https://reader034.fdocuments.in/reader034/viewer/2022042610/58a81fec1a28ab4d148b5f61/html5/thumbnails/4.jpg)
![Page 5: Presentation on circular linked list](https://reader034.fdocuments.in/reader034/viewer/2022042610/58a81fec1a28ab4d148b5f61/html5/thumbnails/5.jpg)
Thank You