Question: What is the difference between a circular linked list and a basic linked list?
Instructor answer: The last element in a circular linked list points to the head of the list.

Student answer: They are passed by reference because you want the function to change the pointer<br>
Score (0-5): 0.5

Student answer: In a circular linked list, every node has a successor which means that the last node's successor is the head or first node.
Score (0-5): 5

Student answer: A circular linked list is a linked list that links items in a continuous circle. This allows the full list to be traversed by starting at any item in the list; a fixed head or tail is not required.
Score (0-5): 4.5

Student answer: In a circular linked list, the last node points to the first node.
Score (0-5): 5

Student answer: On a circular linked list, the end element points to the head, thus making the circle. A basic link list has nothing pointing to the head, and the last element points to null.
Score (0-5): 5

Student answer: the circular linked list's last node points to the begining of the list while a standard linked list points to NULL
Score (0-5): 5

Student answer: The last item in the list points to the head
Score (0-5): 5

Student answer: In a circular linked list, the last node points back to the first node, there is no NULL
Score (0-5): 5

Student answer: Circular linked lists are most useful for describing naturally circular structures, and have the advantage of regular structure and being able to traverse the list starting at any point.
Score (0-5): 2.5

Student answer: A circular linked list has the last node point back to the head of the linked list.
Score (0-5): 5

Student answer: Basic linked list points to a NULL at the end and circular points to the head at the end.
Score (0-5): 5

Student answer: in a circular linked list the the last item points to the first item.
Score (0-5): 5

Student answer: The circular linked list's tail points to the head, whereas the basic linked list's tail points to a NULL.
Score (0-5): 5

Student answer: a basic linked list has an end with a null value where a circular linked list has a pointer from the end to the beginning
Score (0-5): 5

Student answer: how to determine the end of the list, in basic linked lists the last element links to a null pointer, while circular linked lists link to the head element at the end.
Score (0-5): 5

Student answer: No Node in a circular linked list contains NULL, the last Node points pack to a Node within the list.
Score (0-5): 5

Student answer: The difference between a circular linked list and a basic linked list is that a circular linked list, the last node references the first node. Every node in a circular linked list has a successor and no node in a circular linked list contains NULL.
Score (0-5): 5

Student answer: No node in a circular linked list contains NULL.
Score (0-5): 3.5

Student answer: in a circular linked list the last element points to the head of the list
Score (0-5): 5

Student answer: In a regular linked list the last object points to NULL. In a circular linked list, the last object points back to the beginning of the list
Score (0-5): 5

Student answer: In circular linked list each node has successor, no node contains NULL, while in basic linked list last node contain NULL.
Score (0-5): 3

Student answer: in a circular linked lists, the last element points to the first
Score (0-5): 5

Student answer: A circular linked list does not have a last element. Instead, it's last item points to the head of the list.
Score (0-5): 5

Student answer: in a circular linked list, the last node contains a pointer that goes back to the first node; in a basic linked list, the last node contains a null pointer<br>
Score (0-5): 5

Student answer: in a circular linked list, the last object is linked back to the first object.
Score (0-5): 5

Student answer: In the case of a non circular link list, if you are at the last node of the list and u want to move to first u need to go to one, step back till u reach to first. But in circular link list from last to first you need to make only one move. <br>In a single link list u can move only in one direction but in double link list u can move in any direction back or forward or forward.<br><br>
Score (0-5): 3.5