# data[].attributes.body
Slower access and search

# data[].attributes.body
It is easier to insert or delete nodes

# data[].attributes.body
cases to consider:

- list is null (return false)
- front (update head?)
- end (update tail?)
- regular

# data[].attributes.body
Cannot go backwards

# data[].attributes.body
cases to consider:

- list is null (set head/tail)
- add to front (change head?)
- add to end (change tail?)
- add regular

# data[].attributes.body
Utilizes more memory to store the pointers.

# data[].attributes.body
Easier to insert/delete at front

# data[].attributes.body
Can move both backwards and forward

# data[].attributes.body
can only iterate in one direction

# data[].attributes.body
less memory

# data[].attributes.wish_content.attachment_props.question
Do you think you could have done better on the midterm or studied more effectively?

# data[].attributes.body
Click the + at the bottom right. Then, type in a pro or a con from what you discussed. Click publish. Then move it to the right section.

Try to write one that hasn't been mentioned already.

Another option is to expand on something already mentioned by providing details or why you think differently.