Doubly Linked List Flashcards

Flashcards for reviewing Doubly Linked List concepts

Advantages of a Doubly Linked List

• Can be traversed in both directions.
• Deletion is more efficient if the node to be deleted is known.
• Can implement various data structures like stacks, queues, and hash tables.

Disadvantages of a Doubly Linked List

• Requires more space due to the storage of two pointers (previous and next).
• Insertion and deletion operations are more complex and time-consuming.

When to Use a Doubly Linked List

• When backward traversal is required.
• When frequent insertions and deletions are needed in the middle of the list.
• When memory usage is not a primary concern.

Doubly Linked List

A variation of a linked list where navigation is possible in both forward and backward directions.

Link

Each link of a linked list can store a data.

Next

Each link of a linked list contains a link to the next link.

Prev

Each link of a linked list contains a link to the previous link

Linked List

A linked list containing the connection link to the first link and the last link.

Insertion

Adds an element at the beginning of the list.

Insert Last

Adds an element at the end of the list.

Insert After

Adds an element after an item of the list.

Deletion

Deletes an element at the beginning of the list.

Delete Last

Deletes an element from the end of the list.

Delete

Deletes an element from the list using the key.

Display forward

Displays the complete list in a forward manner.

Display backward

Displays the complete list in a backward manner.

Insertion at the Beginning

A node with three compartments: previous, data, and next, inserted at the beginning of the list.

Insertion at the End

Adding a new node at the end of the doubly linked list.

Deletion at the Beginning

Deleting the existing first node in the doubly linked list and shifting the head to the next node.