C++实现双链表的创建、插入、删除、查询、遍历、销毁等基本操作

C++实现双链表的创建、插入、删除、查询、遍历、销毁等基本操作

1.双链表：每个节点（首尾节点除外）都包含指向后继和前驱指针，从某节点出发可向前（后）遍历。

2.代码

#include <iostream>
#include <malloc.h>

using namespace std;
// 双链表的实现
typedef int ElementType;
// 结构体定义
typedef struct DNode{
    ElementType data;
    struct DNode *prior;// 前驱
    struct DNode *next; // 后继
} DNode, *DNodeList;
// 函数声明
DNodeList Create(ElementType e);
bool Insert(DNodeList &L, int pos, ElementType e);
DNodeList Delete(DNodeList &L, int pos);
int SearchByData(DNodeList &L, ElementType e);
bool IsEmpty(DNodeList &L);
bool CheckPos(DNodeList &L, int pos);
int GetLen(DNodeList &L);
bool Destroy(DNodeList &L);
void Print(DNodeList &L);
//创建
DNodeList Create(ElementType e){
    DNodeList ans = (DNodeList) malloc(sizeof(DNode));
    if (ans->data == NULL) return NULL;
    ans->data = e;
    ans->prior = NULL;
    ans->next = NULL;
    return ans;
}
//插入
bool Insert(DNodeList &L, int pos, ElementType e){
    // 检查位置
    if (!CheckPos(L, pos)) return false;
    // 申请节点
    DNodeList n = Create(e);
    if (n == NULL) return false;
    DNodeList cur = L, prior; // 遍历指针、前驱指针
    // 寻找插入位置
    while(cur != NULL && pos-- > 0){
        prior = cur;
        cur = cur->next;
    }
    if (cur != NULL){ // 非尾节点
        cur->prior = n; // 当前指针的前驱指针指向新指针
    }
    n->next = cur;
    n->prior = prior; // 新节点的前驱指针指向新节点
    prior->next = n;
    return true;
}
//删除
DNodeList Delete(DNodeList &L, int pos){
    if (!CheckPos(L, pos)) return NULL;
    DNodeList cur = L, prior;
    // 寻找删除位置
    while(cur != NULL && pos-- > 0){
        prior = cur;
        cur = cur->next;
    }
    if (cur == NULL) return NULL;
    if (cur->next != NULL){
        cur->next->prior = prior;
    }
    prior->next = cur->next; // 跳过当前节点指向下一节点
    free(cur);
    return cur;
}
//查询
int SearchByData(DNodeList &L, ElementType e){
    DNodeList cur = L;
    int pos = 1;
    while(cur != NULL){
        cur = cur->next;
        if (cur->data == e) return pos;
        pos++;
    }
    return -1;
}
//判空
bool IsEmpty(DNodeList &L){
    return L->next == NULL;
}
//检查位置是否合法
bool CheckPos(DNodeList &L, int pos){
    return pos > 0 || pos <= GetLen(L) + 1;
}
//获取长度
int GetLen(DNodeList &L){
    int len = 0;
    DNodeList cur = L;
    while(cur->next != NULL){
        len ++;
        cur = cur->next;
    }
    return len;
}
//销毁
bool Destroy(DNodeList &L){
    DNodeList cur = L;
    while(cur != NULL){
        // 每次都从当前指针删除第1个元素
        if(Delete(cur, 1) == NULL) return false;
        cur = cur->next;
    }
    L = NULL;
    free(L);
    return true;
}
//打印
void Print(DNodeList &L){
    printf("\n");
    DNodeList cur = L;
    while(cur->next != NULL){
        cur = cur->next;
        printf("%d ", cur->data);
    }
    printf("\n");
}
int main()
{
    DNodeList L = Create(0);
    if (L == NULL) printf("创建失败");
    else printf("创建成功");
    for(int i = 0;i < 10; i++){
        Insert(L, i + 1, i + 1);
    }
    Print(L);
    DNodeList del = Delete(L, 3);
    if (del == NULL) printf("删除位置错误");
    else {
        printf("删除元素成功");
        Print(L);
    }
    int e = 4, pos = SearchByData(L, e);
    if (pos != -1) printf("元素%d位于：%d", e, pos);
    else printf("未查找到元素%d", e);
    printf("\n");
    if (Destroy(L)) printf("已销毁");
    else {
        printf("销毁失败");
        Print(L);
    }
    return 0;
}

3.效果