https://padlet.com/jluo3364/oo7lqkc65ewbdn9d data structures en-us 2023-09-11 20:47:14 UTC 2023-10-09 22:14:21 UTC hello@padlet.com jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737354862 Circular Linked Lists]]> 2023-10-08 22:03:03 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737354862 jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737355038 Doubly Linked Lists]]> 2023-10-08 22:03:22 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737355038 jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737357341 2023-10-08 22:09:07 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737357341 jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361426 Pros]]> 2023-10-08 22:20:12 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361426 jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361646 Pros]]> 2023-10-08 22:20:42 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361646 jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361821 Cons]]> 2023-10-08 22:21:11 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361821 jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361942 Cons]]> 2023-10-08 22:21:36 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737361942 jluo3364 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737364255 Instructions: Click the + at the bottom right. Then, type in a pro or a con and include your name in your response. 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. 

Or write about another data structure's pro or con (review for midterm 🤓). Just specificy the data structure and if you're writing a pro or a con.]]> 2023-10-08 22:28:15 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2737364255 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738821734 They are harder to navigate than a traditional Array

Sunil Dass]]> 2023-10-09 21:55:23 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738821734 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738822222 There's more memory usage because each node now has to store a reference to the previous element in addition to the reference to the next.]]> 2023-10-09 21:56:13 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738822222 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738822372 Doubly linked lists consume more memory.
Deleting or inserting a node requires changing two references rather than one, so there is greater runtime as well.

Jonathan Colon]]> 2023-10-09 21:56:28 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738822372 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738822659 Allows traversing in both forward and backward directions

Ayushi Joshi]]> 2023-10-09 21:56:58 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738822659 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738823264 Any node can be starting point -- can traverse the list from any point
Stella Hwang

]]> 2023-10-09 21:58:07 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738823264 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738825118 Allows for easy implementation of a queue

Christopher Lam]]> 2023-10-09 22:00:45 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738825118 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738825808 Doubly linked lists require extra memory for the previous pointer, making them less memory-efficient than circular linked lists.
-Everett Murray ]]> 2023-10-09 22:02:02 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738825808 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738826263 More flexible and easier to call

Truman Leung]]> 2023-10-09 22:02:52 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738826263 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738826459 since there is no distinct head or tail, circular linked lists don't have an endpoint to allow you to recognize a complete traversal.

Kenneth Huang]]> 2023-10-09 22:03:14 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738826459 htv12_ https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738829216 In order to identify the first element (head), it needs to be given a distinct reference, which can use more memory, and also arguably defeats the point of a circular linked list.

Harrison Vallsworth]]> 2023-10-09 22:08:01 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738829216 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738829594 Do not have to worry about out of bounds error if implemented correctly compared to arrays.

Christian Sanchez]]> 2023-10-09 22:08:42 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738829594 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738830286 Has a defined beginning and end with directions pointing to Null

Sunil Dass]]> 2023-10-09 22:09:58 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738830286 https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738832694 Suitable for different applications that would need to navigate forward and back. Ex. history of web pages if you need to go back or forward.

Daniel Wu]]> 2023-10-09 22:14:09 UTC https://padlet.com/jluo3364/oo7lqkc65ewbdn9d/wish/2738832694