dby3579的专栏

实例实现单链表的建立、测长、打印、插入、删除、逆置

实例实现双向链表的创建、测长、打印、插入、删除： //dbList.h文件 typedef struct student { int data; struct student *next; struct student *pre; }dnode; typedef dnode * dbList; typedef dnode * dbPosition; //建立双链表 dbList C

实例实现单向循环链表的创建、测长、打印、插入、删除及逆置 //circularList.h文件 #ifndef CIRCULAR_H_H_H #define CIRCULAR_H_H_H typedef struct student { int data; struct student *next; }cnode; typedef cnode * cirList; typedef cn