DAT305_wk2_Linked_Lists.docx Linked Lists DAT 305 What is the difference between a singly-linked list and a doubly-linked list? In what situation would you use a singly-linked list over a doubly-linked list? In
...
DAT305_wk2_Linked_Lists.docx Linked Lists DAT 305 What is the difference between a singly-linked list and a doubly-linked list? In what situation would you use a singly-linked list over a doubly-linked list? In what situation would you use a doubly-linked list over a singly-linked list? Singly Linked Doubly Linked has nodes with only a data field and next link field. has nodes with a data field, a previous link field and a next link field. The traversal can be done using the next node only. The traversal can be done using the previous node link or the next node link. The SLL occupies less memory than DLL, as it only has 2 fields. DLL occupies more memory than SLL, as it has 2 fields. Less efficient access to elements. More efficient access to elements. We use singly-linked list (SLL) when less memory is available and managing data structure is expected to be simple. The traversal is only able to go in one direction, to the next node. We use doubly-linked list (DLL) when the traversal is to be done using the next and previous node and in both directions, memory is not a focus but efficiency is. Nodes can be deleted with little trouble since there is a previous and a next node. Note: Nodes in SLL cannot be removed unless there is a pointer to its previous. If a node is in a linked list with N nodes, how many nodes will be traversed during a search for the node? Explain the best- and worst-case search scenarios. As we are not directly able to access any element in the linked li. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . .. .. . . . . . . . . . . . . . . . . . .. . . . .
[Show More]
