代码搜索:链表实现

找到约 10,000 项符合「链表实现」的源代码

代码结果 10,000
www.eeworm.com/read/428784/8841459

c 单循环链表.c

# define null 0 typedef char ElemType; typedef struct Circular { ElemType data; struct LNode *next; }; setnull(struct Circular **p) { *p=null; } int length (struct Circular **p) {
www.eeworm.com/read/381695/9076992

txt 单链表练习.txt

假设结点结构如下: typedef struct linknode { ElemType data; struct linknode *next; }node; 一、单选 1、在一个单链表中,已知q所指结点是p所指结点的前驱结点,若在q和p之间插入s结点,则执行( ) (A) s->next=p->next; p->next=s; (B) p->ne
www.eeworm.com/read/376627/9311885

c 单循环链表.c

# define null 0 typedef char ElemType; typedef struct Circular { ElemType data; struct LNode *next; }; setnull(struct Circular **p) { *p=null; } int length (struct Circular **p) {
www.eeworm.com/read/363342/9958312

c 单循环链表.c

# define null 0 typedef char ElemType; typedef struct Circular { ElemType data; struct LNode *next; }; setnull(struct Circular **p) { *p=null; } int length (struct Circular **p) {
www.eeworm.com/read/166786/9997740

cpp 双链表插入.cpp

#include #include //双链表的定义: typedef char DataType; typedef struct dlistnode //结点类型定义 { DataType data; struct dlistnode *prior,*next; }DListNode; typedef DListNode *DLinkL
www.eeworm.com/read/166786/9997752

cpp 双链表删除.cpp

#include #include //双链表的定义: typedef char DataType; typedef struct dlistnode //结点类型定义 { DataType data; struct dlistnode *prior,*next; }DListNode; typedef DListNode *DLinkL
www.eeworm.com/read/166786/9997777

cpp 单链表插入.cpp

#include #include //单链表的定义: typedef char DataType; //DataType可以是任何相应的数据类型如int, float或char typedef struct node //结点类型定义 { DataType data; //结点的数据域 struct node *next; //
www.eeworm.com/read/166786/9997797

cpp 单链表删除.cpp

#include #include //单链表的定义: typedef char DataType; //DataType可以是任何相应的数据类型如int, float或char typedef struct node //结点类型定义 { DataType data; //结点的数据域 struct node *next; //
www.eeworm.com/read/166129/10032517

c 单循环链表.c

#include /*创建一个能调用自身的结构*/ typedef struct cnode { int date; struct cnode *next; }cnode,*linklist; void main() { int m,n,i,j=1; cnode *h,*p,*s; /*以下语句提示用户输入合法的M,N值*/
www.eeworm.com/read/165890/10047804

cpp 双链表插入.cpp

#include #include //双链表的定义: typedef char DataType; typedef struct dlistnode //结点类型定义 { DataType data; struct dlistnode *prior,*next; }DListNode; typedef DListNode *DLinkL