当你努力到把自己都感动的时候，你离成功就不远了。

#include<stdio.h> #include<stdlib.h> #include<Windows.h>#define MAXSIZE 30 typedef struct{ char data; float weight; int parent; int lchild; int rchild;}HTNode;typedef stru

1.栈的顺序存储#include#include#define MAX 20typedef struct SqStack{ int elem[MAX]; int top;//栈顶指针}SqStack;SqStack *Init_SqStack(){ SqStack *S; S = (SqStack *)malloc(sizeof(SqStack)); if (S)

进制转换void Conversion(SqStack *S){ int N,e; printf("输入要转换的十进制数\n"); scanf("%d",&N); while(N) { S=Push(S,N%8); N=N/8; } printf("二进制为:"); while(!StackEmp

#include#include#define TElemType char#define Status int#define OK 1typedef struct BiTNode{ TElemType data; struct BiTNode *lchild, *rchild;}BiTNode, *BiTree;Status Create(BiTree *T){ TEle

1.二叉排序树#include#include#define Status inttypedef struct BiTNode{ int data; struct BiTNode *lchild, *rchild;}BiTNode,*BiTree;Status SearchBST(BiTree T, int key, BiTree f, BiTree *p){//在根指针T

1.循环队列为了防止“假溢出”，采用循环队列#include#include#define ElemType int#define MAX 5#define Status int#define OK 1typedef struct{ ElemType data[MAX]; int front;//头指针 int rear;//尾指针}SqQueue;Status

1.图的数组表示法//无向图#include#include#define INFINITY 999#define MAX_VERTEX 20#define char VertexType //顶点类型#define int EdgeType //边上的权值类型typedef struct { VertexType vexs[MAX_VERTAX];//顶点表 EdgeT

#include#include#define MAXSIZE 100#define Status inttypedef struct{ int i, j;//非零元的行下标和列下标 int e;}Triple;typedef struct{ Triple data[MAXSIZE + 1];//非零元的三元组表，data[0]未用 int mu, nu, tu;//矩阵中

#include#include#include#define MAXSIZE 40#define OK 1#define Status inttypedef char SString[MAXSIZE+1]//0号单元存放串的长度Status StrAssign(SString T,char *chars)//生成一个其值等于chars的子串{    i

集合A用单链表La表示，集合B用单链表Lb表示，设计算法求A与B两个集合的差，即A-B分析：A-B即属于A而不属于B的元素，对集合A的每个元素x，在集合B中进行查找，如果存在与x相同的元素，删除x在A中的结点。#include#includetypedef struct Lnode{ int data; struct Lnode *next;}Lnode;st

1.顺序表 #include #include #define MAX 20 typedef struct { int elem[MAX]; int length; }Seqlist; Seqlist Initlist()//顺序表的初始

#include#include#define MAX 20#define ELEMTP int#define v (*p)struct node{ ELEMTP data; struct node *next;};int n = 0;//计数struct node *create(void)//尾插法建立链表{ struct node *head, *p, *s;

void maopao(int a[]) {//简单的冒泡排序 int i, j,temp,n=10; for (i = 1; i < n;i++) for (j = 0; j < n - i; j++) { if (a[j]>a[j + 1]) { temp = a[j]; a[j] = a[j