代码搜索:链式
找到约 448 项符合「链式」的源代码
代码结果 448
www.eeworm.com/read/425218/10369447
c ch2_ltable.c
/*
表的链式实现(插入操作保持)
author: kk.h
date: 2006.9
http://www.cocoon.org.cn
*/
#include "stdio.h"
/* 数据元素的类型 */
typedef struct{
int no;
int grade;
}ElemType;
/* 链表节点的类型(包括头节点) */
typedef
www.eeworm.com/read/274763/10853868
h list.h
//线性表的链式存储结构的十项基本操作
#include
#include
//结点定义
typedef struct lnode
{
int data;
struct lnode *next;
}lnode,*linklist;
//出错处理
void errormessage(char *s)
{
cout
www.eeworm.com/read/272007/10974348
txt 二叉树排序树类的定义与实现.txt
//二叉排序树BinSortT.cpp
#include
#include
#include
//二叉树的链式存储结构表示
typedef struct BinaryTree
{ int data;
struct BinaryTree *l;
struct BinaryTree *r;
}*BiTree
www.eeworm.com/read/299227/7875042
cpp linearstack2.cpp
// 链式堆栈的实现linearStack2.cpp
#include "linearStack2.h"
#include
//构造函数
LinStack::LinStack()
{top=NULL;size=0;}
//初始化栈,分配存储空间并置空
void LinStack::InitStack(int L)
{top=new StackNode[
www.eeworm.com/read/299227/7875043
cpp linearstack2m.cpp
// 链式堆栈的测试linearStack2m.cpp
#include
#include
typedef int ElemType;
#include "linearStack2.cpp"
void main()
{cout
www.eeworm.com/read/299227/7875185
cpp binsortt.cpp
//二叉排序树BinSortT.cpp
#include
#include
#include
//二叉树的链式存储结构表示
typedef struct BinaryTree
{ int data;
struct BinaryTree *l;
struct BinaryTree *r;
}*BiTree
www.eeworm.com/read/240259/13228296
cpp binsortt.cpp
//二叉排序树BinSortT.cpp
#include
#include
#include
//二叉树的链式存储结构表示
typedef struct BinaryTree
{ int data;
struct BinaryTree *l;
struct BinaryTree *r;
}*BiTree
www.eeworm.com/read/240259/13228313
cpp linearstack2.cpp
// 链式堆栈的实现linearStack2.cpp
#include "linearStack2.h"
#include
//构造函数
LinStack::LinStack()
{top=NULL;size=0;}
//初始化栈,分配存储空间并置空
void LinStack::InitStack(int L)
{top=new StackNode[
www.eeworm.com/read/240259/13228412
cpp linearstack2m.cpp
// 链式堆栈的测试linearStack2m.cpp
#include
#include
typedef int ElemType;
#include "linearStack2.cpp"
void main()
{cout
www.eeworm.com/read/313800/13580631
cpp lr0.cpp
// LR0.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include
#include
#include
using namespace std;
//定义链式栈的节点类
class link
{
public:
char element;
link *next