Double linked list related operations

Double linked list related operations

Double linked list related operations

Initialization of double linked list

#include<stdio.h>
typedef struct DNode{
    
int data;
struct DNode *prior,*next;
}DNode,*DLinklist;


// Initialize double linked list 
bool InitDLinkList(DLinklist &L){
    
    L=(DNode*)malloc(sizeof(DNode)); // Assign a head node 
    if(L==NULL){
    
        return false;
    }
    
    L->prior=NULL;  // The first node prior For ever NULL
    L->next=NULL;
    
    return true;
}

// The list is empty 
bool Empty(DLinklist L){
    
    if(L->next==NULL)
        return true;
    else 
        return false;
}

void main(){
    
    DLinklist L;
    InitDLinkList(L);
}

Insertion of double linked list

bool InsertNextDNode(DNode *p,DNode *s){
    
    if(p==NULL||s==NULL){
    
        return false;
    }
    
    s->next=p->next;  // The node *s Insert to node *p after 
    if(p->next!=NULL)
        p->next->prior=s;
    s->prior=p;
    p->next=s;
    return true;
}

Deletion of double linked list nodes

// Delete p The successor node of a node 
bool InsertNextDNode(DNode *p){
    
    if(p==NULL){
    
        return false;
    }
    DNode *q=p->next;  // find p The successor node of 
    if(q==NULL){
    
        return false;   //p No successor nodes 
    }
    p->next=q->next;   
    if(q->next!=NULL)    //q Node is not the last node 
        q->next->prior=p
    free(q);           // Release node space 
    return true;
}

Destroy a double linked list

Traversal of double linked list