Doubly linked list | Doubly liked list in c

A doubly linked list is a type of linked data structure that consists of a sequence of elements, where each element, called a node, contains data and two pointers. The first pointer, called the next pointer, points to the next node in the sequence, and the second pointer, called the prev (previous) pointer, points to the previous node.
Key Characteristics:
1. Bidirectional Traversal: Unlike a singly linked list, which can only be traversed in one direction (from the first node to the last), a doubly linked list allows traversal in both directions—forward and backward.
2. Nodes: Each node in a doubly linked list contains:
o Data: The value or data the node holds.
o Next Pointer: A reference to the next node in the list.
o Prev Pointer: A reference to the previous node in the list.
Basic Operations:
1. Insertion: A new node can be inserted at the beginning, end, or any position in the list.
2. Deletion: A node can be removed from the list, with pointers updated to maintain the list's structure.
3. Traversal: The list can be traversed in either direction, starting from any node.
4. Searching: Nodes can be searched for a specific value or condition.

Links
   • Introduction to Linked list | linked list ...  (Part-11 Linked List in C)
   • String in c|Structure|  Union  (Part-10 String, Structure and Union in C)
   • variable and memory location | variable an...  (Part-9 variable, memory address, pointer)
   • Array in c | Array meaning | Arrays intro ...  (Part-8 variable,memory address, pointer concept)
   • functions in c programming | function in c...  (Part-7 function)
   • Loop in c | loop  (Part-6 while loop)
https://youtu.be/fdI1kOyPC1Y(Part-5-D... run etc)
   • Loop এর দুনিয়ায় পদার্পণ... আজ শুধু for loop  (Part-4-Loop)
   • Data types in c | compilation and executio...  (Part-3-switch-modulo-integer division)
   • if - else | program concept  (Part-2-if-else)
   • What is coding ? | About Coding | Programm...   (Part-1-Programming concept and Basics