Why Doubly Linked List Over Singly Linked List in DSA Python - Quick Recap

Recall & Review

beginner

What is a doubly linked list?

A doubly linked list is a type of linked list where each node has two links: one to the next node and one to the previous node. This allows traversal in both directions.

beginner

What is the main difference between singly and doubly linked lists?

Singly linked lists have nodes with one link pointing only to the next node, while doubly linked lists have nodes with two links: one to the next node and one to the previous node.

beginner

Why is traversal easier in a doubly linked list compared to a singly linked list?

Because each node in a doubly linked list has a link to the previous node, you can move forward and backward easily. In a singly linked list, you can only move forward.

intermediate

How does a doubly linked list improve deletion of a node compared to a singly linked list?

In a doubly linked list, you can delete a node easily if you have a pointer to it because you can access its previous node directly. In a singly linked list, you need to find the previous node by traversing from the head.

intermediate

What is a downside of using a doubly linked list over a singly linked list?

A doubly linked list uses more memory because each node stores an extra pointer to the previous node. This can make it less memory efficient than a singly linked list.

Which linked list allows traversal in both directions?

A Doubly linked list

B Singly linked list

C Circular linked list

D None of the above

Doubly linked lists have pointers to both next and previous nodes, allowing forward and backward traversal.

What extra pointer does a doubly linked list node have compared to a singly linked list node?

A Pointer to the previous node

B Pointer to the head node

C Pointer to the tail node

D Pointer to the next node

Doubly linked list nodes have an extra pointer to the previous node, enabling backward traversal.

Why is deleting a node easier in a doubly linked list if you have a pointer to that node?

A Because nodes have no pointers

B Because you can access the previous node directly

C Because nodes are stored in an array

D Because the list is sorted

Having a pointer to the previous node allows easy update of links during deletion.

What is a disadvantage of doubly linked lists compared to singly linked lists?

A Cannot traverse backwards

B Slower insertion at head

C Uses more memory per node

D No advantage in deletion

Doubly linked lists use extra memory for the previous pointer in each node.

If you want to move backward in a linked list, which type should you use?

A Queue

B Singly linked list

C Stack

D Doubly linked list

Only doubly linked lists allow backward movement through previous pointers.

Explain why a doubly linked list might be preferred over a singly linked list for certain operations.

Think about how nodes connect and how that affects moving and deleting nodes.

Describe the trade-offs between using a singly linked list and a doubly linked list.

Consider memory use versus ease of navigation.