realfancy的博客

#include<iostream>#include<cstdio>#define LIST_INIT_SIZE 100 //初始数量#define LISTINCREMENT 10 //增加量#define LA_INITLEN 3 //La初始长度#define LB_INITLEN 4 //Lb初始长度typede

#include<iostream>#include<stdio.h>#include<math.h>#define SIZE 5using namespace std;int* Compress(int *m) { int*n = (int*)malloc(sizeof(int)*(SIZE*(SIZE+1)/2)); int i = 0; int j = 0;

#include<iostream>#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define QUEUE_INIT_SIZE 100#define MAXSIZE 100typedef int SElemType;typedef int QElemType;//typedef int Status;enum Status{

（1）二叉树的创建（2）对进行先，中，后序遍历// Bitree.cpp: 定义控制台应用程序的入口点。//#include<iostream>#include<stdio.h>using namespace std;typedef char TElemType;enum Status { OK = 1,ERROR = 0 };//枚举类型typedef struct BiTNode{/

（1）二叉树的线索化（2）对线索二叉树进行中序遍历#include<iostream>using namespace std;typedef char TElemType;enum Status {OK = 1,ERROR = 0};enum PointerTag{Link = 0,Thread = 1};//typedef struct BiTNode {// TElemType dat

普里姆算法#include<stdio.h>#include<stdlib.h>#define INFINITY INT_MAX#define MAX_VERTEX_NUM 20typedef enum {DG,DN,UDG,UDN}GraphKind;typedef enum {ERROR,OK}Status;typedef int VRType;typedef int Vertex