xiaochaocnn的专栏

#include#includetypedef char TElemType;typedef int status;typedef struct BiTNode{ TElemType data;//树的节点的值 struct BiTNode *lchild,*rchild;//定义树的左孩子指针和右孩子指针}BiTNode,*BiTree;//先序创建二叉树status

#include#includetypedef struct ListNode{int data;struct ListNode *next;}ListType;//创建ListType *createlist(int n){// int n;ListType *head,*s,*r;head=(ListType *)malloc(sizeof(ListType

//c语言#include#include#define LIST_INIT_SIZE 100 //线性表存储空间的初始分配量#define LISTINCREASE 10 // 线性表存储空间的分配增量typedef int ElemType;typedef int Status;typedef struct{ ElemType *elem;/* 存储空间的首地址 */

#include#include#include#define True 1#define False 0#define ok 1#define Error 0#define Infeasible -1#define Overflow -2#define price 0.05//--*-*-*-*-*-*-*-*-车辆信息定义*-*-*-*-*-*-*//typedef

#include#include#include#include //#define INFINITY INT_MAX//用整型最大值代替无穷大#define MAX_VERTEX_NUM 20//最大的顶点的个数#define MAX_NAME 3//定点字符串的最大长度+1typedef int VRType;typedef char VertexType[MAX_NAME]

#include#include#include "queue.h"#define MAX_VERTEX_NUM 20typedef int VertexType;typedef struct ArcNode{ int adjvex;//该弧所指向的顶点的位置 struct ArcNode *nextarc;//指向下一条弧的指针}ArcNode;typedef struc