Question: What is the main disadvantage of a doubly-linked list over a basic linked list?
Instructor answer: Extra space required to store the back pointers.

Student answer: they take up twice as much memory for each node
Score (0-5): 5

Student answer: In a doubly linked list, there are more pointers to set and the mechanics of inserting and deleting are more difficult. Also, the special cases at the beginning or end of the list are more complicated.
Score (0-5): 3.5

Student answer: There are more pointers to set, the mechanics of inserting into and deleting from a doubly linked list are a bit more involved than for a singly linked list.
Score (0-5): 4

Student answer: Insertion and deletion with a doubly linked list are more involved than with a singly linked list leaving more room for error and complex algorithms.
Score (0-5): 3

Student answer: Need more memory to store "previous" pointers.
Score (0-5): 5

Student answer: a node in a doubly linked list takes up more memory than a node in a singly linked list.
Score (0-5): 5

Student answer: You have to keep up with where you are and you have to consider the predecessor and successor connections when inserting/deleting.
Score (0-5): 3

Student answer: Each node requires an extra node, requires more memory, and is more difficult to insert and remove individual nodes
Score (0-5): 5

Student answer: Double-linked lists require more space per node, and their elementary operations are more expensive
Score (0-5): 5

Student answer: More difficult to delete and create nodes.
Score (0-5): 3

Student answer: They use more memory and you have to make 2 pointers and update 2 pointers each time you change the list.
Score (0-5): 5

Student answer: nodes take up more memory
Score (0-5): 5

Student answer: Each node requires an extra pointer (space requirements increased), Insertion or deletion of a node takes a longer (more pointer operations).
Score (0-5): 5

Student answer: its a little more confusing. The special cases at the end and beginning become more difficult to do.
Score (0-5): 3

Student answer: increased actions to add and remove elements to the linked list.
Score (0-5): 3

Student answer: Inserting and deleting in a double-linked list is more involved, and has special cases at the beginning and end.
Score (0-5): 3

Student answer: The main disadvanate is that if hard to remove all items in the list.
Score (0-5): 2

Student answer: each node requires an extra pointer, taking up more storage.  insertions and deletions require more pointer operations.
Score (0-5): 5

Student answer: in a doubly linked list there are twice as many pointers for each element , therefore more memory is used
Score (0-5): 5

Student answer: The process of adding and removing Nodes in a Doubly linked list is more complex than in a basic linked list
Score (0-5): 3.5

Student answer: Double linked lists require more space per node, and their elementary operation are more expensive
Score (0-5): 5

Student answer: 1- each node requires an extra pointer, requiring more space<br>2- the insertion or deletion of a node takes a bit longer, more pointer operations
Score (0-5): 5

Student answer: It takes up twice the storage needed.
Score (0-5): 5

Student answer: using more pointers to enable the backward movement takes up more memory, having more pointers make it slightly more work to add or remove a node from the list
Score (0-5): 5

Student answer: increased memory requirements, slightly more complicated when modifying elements in the list
Score (0-5): 5

Student answer: not answered
Score (0-5): 0