What are the basic operations of a doubly linked list?

What are the basic operations of a doubly linked list?

The basic operations of a doubly linked list include insertion, deletion, and traversal.

Can you explain how to insert a node at the beginning?

To insert a node at the beginning, create a new node, set its next pointer to the current head, and update the head.

How do I delete a node from the end?

To delete a node from the end, traverse to the last node, update the previous node's next pointer, and remove the last node.

What is the time complexity for these operations?

The time complexity for insertion and deletion is O(1) if you have a pointer to the node, and O(n) for traversal.