introductiong to circular singly linked list (3).pptx
- 2. MEANING OF CIRCULAR LINKED LIST • In a circular Singly linked list, the last node of the list contains a pointer to the first node of the list. We can have circular singly linked list as well as circular doubly linked list. • We traverse a circular singly linked list until we reach the same node where we started. The circular singly liked list has no beginning and no ending. There is no null value present in the next part of any of the nodes.
- 3. WORKING OF CIRCUILAR SINGLY LINKED LIST A circular linked list is a variation of linked lists where the pointer of the last node instead of pointing to NULL points to the first or the head node. This connects the first node with the last node resulting in a circle of interconnected nodes. There is no NULL at the end.
- 4. MEMORY REPRESENTATION OF CIRCULAR SINGLY LINKED LIST • In the following image, memory representation of a circular linked list containing marks of a student in 4 subjects. However, the image shows a glimpse of how the circular list is being stored in the memory. The start or head of the list is pointing to the element with the index 1 and containing 13 marks in the data part and 4 in the next part. Which means that it is linked with the node that is being stored at 4th index of the list. However, due to the fact that we are considering circular linked list in the memory therefore the last node of the list contains the address of the first node of the list. Each node has only one pointer i.e. next pointer. The next pointer of the last node of the list points to the first node of the list creating a circular structure. We can transverse only in one direction in a circular manner in this.
- 5. WORKING OF MEMORY REPRESENTATION OF CIRCULAR SINGLY LINKED LIST
- 6. OPERATIONS ON CIRCULAR SINGLY LINKED LIST • There are 4 types • Insertion • Deletion • Searching • Traversing
- 7. OPERATIONS ON CIRCULAR SINGLY LINKED LIST • Insertion • Insertion at beginning: Adding a node into circular singly linked list at the beginning. • Insertion at the end: Adding a node into circular singly linked list at the end. • Deletion & Traversing • Deletion at beginning: Removing the node from circular singly linked list at the beginning. • Deletion at the end Removing the node from circular singly linked list at the end. • Searching: Compare each element of the node with the given item and return the location at which the item is present in the list otherwise return null. • Traversing: Visiting each element of the list at least once in order to perform some specific operation.
- 8. END OF CIRCULAR SINGLY LINKED LIST Done by Group Harika Shri Hari Hemanth Janushree Koushik