This presentation contains the introduction about the linked list and it's types. And further more contain details about the doubly linked list. I have covered algorithm of adding and deleting items from doubly linked list.

2. •
•
•
•
•
•
A presentation by Pramod Poudel 2

3. A presentation by Pramod Poudel 3

4. •
•
•
•
•
A presentation by Pramod Poudel 4

5. •
•
•
•
A presentation by Pramod Poudel 5

6. •
A presentation by Pramod Poudel 6

7. •
tail
A presentation by Pramod Poudel 7

8. •
A presentation by Pramod Poudel 8

9. •
A presentation by Pramod Poudel 9

10. struct Node{
int data;
struct Node* prev;
struct Node* next;
};
Struct Node *head= Node *tail=null;
Doubly linked list
A presentation by Pramod Poudel 10

11. void InsertAtHead(int data, node **head, node **tail){
struct node *newnode =(struct Node*)malloc(sizeof(struct Node));
newnode->data=data;
if(*head==null){
newnode->next=newnode->prev=null;
*head=*tail=newnode;
}
else{
newnode->prev=null;
newnode->next=*head;
(*head)->prev=newnode;
*head=newnode;
}
}
At the beginning
A presentation by Pramod Poudel 11

12. At the end
void InsertAtTail(int data, node **head, node **tail){
struct node *newnode =(struct Node*)malloc(sizeof(struct Node));
newnode->data=data;
if(*head==null){
newnode->next=newnode->prev=null;
*head=*tail=newnode;
}
else{
newnode->next=null;
newnode->prev=*tail;
(*tail)->next=newnode;
*tail=newnode;
}
}
A presentation by Pramod Poudel 12

13. From beginning
void deletefirst(node **head, node **tail){
struct node *temp =(struct Node*)malloc(sizeof(struct Node));
if(*head==null){
return;
}
temp=*head;
if(*head==*tail)
*head=*tail=null;
else{
(temp->next)->prev=null;
*head=temp->next
}
free(temp);
}
A presentation by Pramod Poudel 13

14. From end
void Deletelast(node **head, node **tail){
struct node *temp =(struct Node*)malloc(sizeof(struct Node));
if(*head==null){
return;
}
temp=*tail;
if(*head==*tail)
*head=*tail=null;
else{
(temp->prev)->next=null;
*tail=temp->prev;
}
free(temp);
}
A presentation by Pramod Poudel 14

15. void InsertAtposition(int data, int position){
int count=0;
struct node *current;
current=head;
while(current!=NULL)
{
count++;
if(count==position-1)
{
temp=(struct node*)malloc(sizeof(struct node));
temp->data=value;
temp->next=current->next;
current->next=temp;
temp->prev=current;
temp->next->prev=temp;
}
current=current->next;
}
}
A presentation by Pramod Poudel 15

16. void delete_node(int position)
{
int count=0;
struct node *current;
current=head;
if(position==1)
{
head->next->prev=NULL;
head=head->next;
}
else
{
while(current!=NULL)
{
count++;
if(count==position-1)
{
if(current->next->next==NULL)
{
current->next=current->next->next;
}
else
{
current->next=current->next->next;
current->next->prev=current;
current=current->next;
break;
}
}
current=current->next;
}
}
A presentation by Pramod Poudel 16