Doubly_Linked_List

#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>

using namespace std;

struct Dulist
{
    int data;
    Dulist *prior;
    Dulist *next;
};
Dulist *head;
void Init_Node()
{
    head->data = 0;
    head->prior = NULL;
    head->next = NULL;
}

void Insert_Node(Dulist *Q, int data, int index)
{
    Dulist *p = (Dulist *)malloc(sizeof(Dulist));
    p = head;
    for (int i = 0; i < index; i++)
    {
        p = p->next;
    }
    Q->prior = p;
    p->next->prior = Q;
    Q->next = p->next;
    p->next = Q;
}

void Delete_Node(int index)
{
    Dulist *p = (Dulist *)malloc(sizeof(Dulist));
    p = head;
    for (int i = 0; i < index; i++)
    {
        p = p->next;
    }
    p->prior->next = p->next;
    p->next->prior = p->prior;
}

int main()
{

}