Xóa 1 Node trong danh sách liên kết đôi

    ---------------------------------------------

    |              |             |              |

    |     PREV     |     DATA    |    NEXT      |

    |              |             |              |

    ---------------------------------------------

struct Node  {

    int data;

    struct Node* next;

    struct Node* prev;

};

struct Node* head; // Khởi tạo Node head global của dslk đôi.

struct Node* GetNewNode(int x) {

    struct Node* newNode

        = (struct Node*)malloc(sizeof(struct Node));

    newNode->data = x;

    newNode->prev = NULL;

    newNode->next = NULL;

    return newNode;

}

void InsertAtHead(int x) {

    struct Node* newNode = GetNewNode(x);

    if(head == NULL) {

        head = newNode;

        tail = newNode;

        return;

    }

    head->prev = newNode;

    newNode->next = head;

    head = newNode;

}

void InsertAtTail(int x) {

    struct Node* newNode = GetNewNode(x);

    if(head == NULL) {

        head = newNode;

        tail = newNode;

        return;

    }

    tail->next = newNode;

    newNode->prev = tail;

    tail = newNode;

}

void DeleteAtHead() {

    if(head == NULL) {

        return;

    }

    head = head->next;

    head->prev = NULL;

}

void DeleteAtTail() {

    if(head == NULL) {

        return;

    }

    tail = tail->prev;

    tail->next = NULL;

}

void Print() {

    struct Node* temp = head;

    printf("\nForward: ");

    while(temp != NULL) {

        printf("%d ",temp->data);

        temp = temp->next;

    }

    printf("\n");

}

void ReversePrint() {

    struct Node* temp = tail;

    if(temp == NULL) return; // empty list, exit

    // Traversing backward using prev pointer

    printf("\nReverse: ");

    while(temp != NULL) {

        printf("%d ",temp->data);

        temp = temp->prev;

    }

    printf("\n");

}

/* Doubly Linked List implementation */

#include

#include

struct Node  {

    int data;

    struct Node* next;

    struct Node* prev;

};

struct Node *head, *tail; // Khởi tạo Node head global của dslk đôi.

//Creates a new Node and returns pointer to it.

struct Node* GetNewNode(int x) {

    struct Node* newNode

        = (struct Node*)malloc(sizeof(struct Node));

    newNode->data = x;

    newNode->prev = NULL;

    newNode->next = NULL;

    return newNode;

}

//Inserts a Node at head of doubly linked list

void InsertAtHead(int x) {

    struct Node* newNode = GetNewNode(x);

    if(head == NULL) {

        head = newNode;

        tail = newNode;

        return;

    }

    head->prev = newNode;

    newNode->next = head;

    head = newNode;

}

//Inserts a Node at tail of Doubly linked list

void InsertAtTail(int x) {

    struct Node* newNode = GetNewNode(x);

    if(head == NULL) {

        head = newNode;

        tail = newNode;

        return;

    }

    tail->next = newNode;

    newNode->prev = tail;

    tail = newNode;

}

void DeleteAtHead() {

    if(head == NULL) {

        return;

    }

    head = head->next;

    head->prev = NULL;

}

//Inserts a Node at tail of Doubly linked list

void DeleteAtTail() {

    if(head == NULL) {

        return;

    }

    tail = tail->prev;

    tail->next = NULL;

}

//Prints all the elements in linked list in forward traversal order

void Print() {

    struct Node* temp = head;

    printf("\nForward: ");

    while(temp != NULL) {

        printf("%d ",temp->data);

        temp = temp->next;

    }

    printf("\n");

}

//Prints all elements in linked list in reverse traversal order.

void ReversePrint() {

    struct Node* temp = tail;

    if(temp == NULL) return; // empty list, exit

    // Traversing backward using prev pointer

    printf("\nReverse: ");

    while(temp != NULL) {

        printf("%d ",temp->data);

        temp = temp->prev;

    }

    printf("\n");

}

int main() {

    /*Driver code to test the implementation*/

    head = NULL; // empty list. set head as NULL.

    // Calling an Insert and printing list both in forward as well as reverse direction.

    InsertAtTail(2);

    Print(); ReversePrint();

    InsertAtTail(4);

    Print(); ReversePrint();

    InsertAtHead(6);

    Print(); ReversePrint();

    InsertAtTail(8);

    Print(); ReversePrint();

    DeleteAtHead();

    Print(); ReversePrint();

    DeleteAtTail();

    Print(); ReversePrint();

}

Forward: 2

Reverse: 2

Forward: 2 4

Reverse: 4 2

Forward: 6 2 4

Reverse: 4 2 6

Forward: 6 2 4 8

Reverse: 8 4 2 6

Forward: 2 4 8

Reverse: 8 4 2

Forward: 2 4

Reverse: 4 2

Process returned 0 (0x0)   execution time : 0.040 s

Press any key to continue.