資訊之芽 2017 170 Doubly linked list

sprout-double-linked-list.cpp

struct node {
    int data;
    node *prev, *next; //分別指向前一格與後一格
};

void insert(node *prev, int data) {
    node* newNode = new node;
    newNode->data = data;
    newNode->prev = prev;
    newNode->next = prev->next;
    if(prev->next)
        prev->next->prev = newNode;
    prev->next = newNode;
}

void remove(node* ptr) {
    node* next = ptr->next;
    node* prev = ptr->prev;
    if(next)
        next->prev = prev;
    if(prev)
        prev->next = next;
    delete ptr;
}