Question: What is the main advantage of a doubly-linked list over a basic linked list?
Instructor answer: All the deletion and insertion operations can be performed in constant time, including those operations performed before a given location in the list or at the end of the list.

Student answer: they can traverse in both directions
Score (0-5): 3.5

Student answer: In a doubly linked list you can delete a node without having to traverse the list.
Score (0-5): 4.5

Student answer: A doubly-linked list allows you to delete a node without traversing the list to establish a trailing pointer.
Score (0-5): 4.5

Student answer: A doubly linked list allows you to traverse the list in either direction. Each node points to its successor as well as to its predecessor.
Score (0-5): 3.5

Student answer: Doubly-linked lists can traverse backwards, though they still cannot access data at any point in the list, it can be shorter to traverse backwards.
Score (0-5): 3.5

Student answer: you can traverse the list from front to back and back to front
Score (0-5): 3.5

Student answer: You can traverse the list in reverse.
Score (0-5): 3.5

Student answer: Doubly linked lists can be traversed in both directions
Score (0-5): 3.5

Student answer: Double-linked lists require more space per node, and their elementary operations are more expensive; but they are often easier to manipulate because they allow sequential access to the list in both directions.
Score (0-5): 3.5

Student answer: You can traverse forwards and backwards through nodes.
Score (0-5): 3.5

Student answer: You can point both forwards and backwards
Score (0-5): 3.5

Student answer: You can go backwards in the linked list and access previous data easier without having to keep track of the previous item
Score (0-5): 4

Student answer: Doubly linked lists allow backward movement through the nodes.
Score (0-5): 3.5

Student answer: they have double pointers, so each node can point forwards or backwards. Making it a little easer to get to where you need.
Score (0-5): 3.5

Student answer: ability to backtrack through a list.
Score (0-5): 3

Student answer: You can move forwards and backwards in the double-linked list. Basic only moves forwards.
Score (0-5): 3.5

Student answer: The advantage is that each node points to bothe its predecessor and its successor. There are no special cases for insertion and deletion.
Score (0-5): 4.5

Student answer: each node points to both its predecessor and its successor.
Score (0-5): 3.5

Student answer: a doubly linked list has pointers in both directions. this allows for access from back to front as well as front to back
Score (0-5): 4

Student answer: A doubly linked list can be traversed either direction, while a normal linked list can only be traversed from start to finish
Score (0-5): 3.5

Student answer: Double Linked list are often easier to manipulate, because they allow sequential access to the list in both direction
Score (0-5): 4

Student answer: given a node in the list, one can navigate easily in either direction
Score (0-5): 4

Student answer: You can traverse the list both forward and backwards.
Score (0-5): 3.5

Student answer: a doubly linked list allows you to back up from a node rather than having to go through the entire list again<br>
Score (0-5): 4

Student answer: Gives faster times for some operations such as insertion and deletion
Score (0-5): 5

Student answer: The primary disadvantage of doubly linked lists are that (1) each node requires an extra pointer, requiring more space, and (2) the insertion or deletion of a node takes a bit longer (more pointer operations).
Score (0-5): 2