Explain the difference between a circular linked list and a singly linked list
Answers
Circular linked list.....
1)Two pointers are maintained in a node of circular list, one will keep the address of first previous node and first next node in sequence.
²)In circular list, we can move backward as well as forward direction as each node keeps the address of previous and next node in sequence.
3)During deletion, we have to keep only one node address i.e the node to be deleted. This node will give the address of previous node automatically.
Singly linked list......
1)Only one pointer is maintained in a node of singly list which contains the address of next node in sequence another will keep the address of.
2)In singly, we can not move in backward direction because each in node has next node pointer which facilitates us to move in forward direction.
3)During deletion of a node in between the singly list, we will have to keep two nodes address one the address of the node to be deleted and the node just previous of it.
plz mark it as a brainlist..........
The circular linked list form a circle whereas the singly linked list does not form a circle.
Explanation:
- The singly linked list is a linked list which is a set of multiple nodes (contains information and address of another node) connected with each other and contains null in the address part of the last node. It is used to traverse the nodes until the last node is not reached.
- The circular linked list is a linked list which is also the set of multiple nodes (contains information and address of another node) connected with each other and does not contain null in the address part of the last node. It is because the last node contains the address of the first node which makes the linked list circular and there is no endpoint found on this list.
Learn More:
- Circular, doubly and singly Linked List : https://brainly.in/question/13555346