代码搜索:链表实现
找到约 10,000 项符合「链表实现」的源代码
代码结果 10,000
www.eeworm.com/read/481249/6646472
c 单链表2.c
#include
#include
struct node{
int key;
struct node *next;
};
void creat_link(struct node *);
main()
{
struct node *head=NULL;
creat_li
www.eeworm.com/read/264720/11303729
cpp 二叉链表.cpp
/*建立二叉树的链式存储结构,在此基础上完成下列算法:
1) 从键盘上输入二叉树的各个结点,建立二叉链表
2) 输出该二叉树;
3) 非递归的层次遍历序;
4) 非递归的先序遍历、中序遍历、后序遍历;
*/
#include
#include
#include
#define Maxlength 10
ty
www.eeworm.com/read/408164/11403279
doc 线索链表类声明.doc
www.eeworm.com/read/408164/11403281
doc 线索链表结点声明.doc
www.eeworm.com/read/408164/11403335
doc 单链表结点声明.doc
www.eeworm.com/read/408164/11403341
doc 单链表类声明.doc
www.eeworm.com/read/408164/11403350
doc 双链表节点声明.doc
www.eeworm.com/read/405283/11466991
c 双链表正排序.c
#include
#include
#include
struct list{
int data;
struct list *next;
struct list *pre;
};
typedef struct list node;
typedef node *link;
link fr
www.eeworm.com/read/405283/11466993
c 建立链表1.c
/* 链表建立程序 */
#include"stdio.h"
#include
#define NULL 0
#define LEN sizeof(struct student)
struct student
{long num;
int score;
struct student *next;
};
int n; /*全局变量n*/
str
www.eeworm.com/read/405283/11466996
c 单链表倒序.c
#include
struct fsb
{
int data;
int flag;
struct fsb * next;
};
main()
{
struct fsb *p,*head,*sta,*end;
int i,cishu,j;
end=(struct fsb *)malloc(sizeof(struct fsb))