#Day28 #100DaysOfCode
in doubly linked list, you can traverse backwards, which cannot be easily done in singly linked list.
doubly linked list differs with singly linked list in a way that it has an extra prev pointer which points to the previous node. It's nothing but more assignment of the pointers.
with either singly or doubly linked list, the basic operations are add_head, add_tail, insertAfter a node, deletehead, deletetail, delete random, display, and sort.
with doubly linked list, there are print forward and backward.
in doubly linked list, you can traverse backwards, which cannot be easily done in singly linked list.
doubly linked list differs with singly linked list in a way that it has an extra prev pointer which points to the previous node. It's nothing but more assignment of the pointers.
with either singly or doubly linked list, the basic operations are add_head, add_tail, insertAfter a node, deletehead, deletetail, delete random, display, and sort.
with doubly linked list, there are print forward and backward.
