- 博客(9)
- 收藏
- 关注
RSS订阅原创 二叉树的二叉链表实现
#ifndef HEAD_H__#define HEAD_H__#include#include#include#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define OVERFLOW -2typedef int status;typedef int boolean;//元素定义合集//////
2013-01-28 15:37:03
512
原创 链式队列
#ifndef QUEUE_H__#define QUEUE_H__#include"head.h"typedef struct QueueNode{ QElementType elem; struct QueueNode *next;}QueueNode,*QueuePtr;typedef struct{ QueuePtr front; QueuePtr rear;}l
2013-01-21 22:51:13
219
原创 迷宫
#ifndef SQSTACK_H__#define SQSTACK_H__#include"head.h"#define STACK_INIT_SIZE 100#define STACKINCREMENT 10struct stack{ SElementType *base; SElementType *top; int stackSize;};typedef stru
2013-01-21 20:43:55
204
原创 栈的实现和测试
#ifndef STACK_H__#define STACK_H__#include"head.h"#define STACK_INIT_SIZE 100#define STACKINCREMENT 10struct stack{ ElementType *base; ElementType *top; int stackSize;};typedef struct sta
2013-01-20 10:51:35
266
原创 双向循环链表
#ifndef HEAD_H__#define HEAD_H__#include#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int status;typedef int boolean;typedef int ElementType;#define MAX 100void view(El
2013-01-06 22:16:49
316
原创 静态链表
#ifndef HEAD_H__#define HEAD_H__#include#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int status;typedef int boolean;typedef int ElementType;#define MAX 100void view(El
2013-01-06 14:01:19
325
原创 链表实现
#ifndef HEAD_H__#define HEAD_H__#include#define ERROR 0#define OK 1#define FALSE 0#define TRUE 1typedef int status;typedef int boolean;typedef int ElementType;#define MAX 100void view(Ele
2013-01-05 21:50:13
255
原创 顺序表实现
#ifndef HEAD_H__#define HEAD_H__#include#define ERROR 0#define OK 1#define FALSE 0#define TRUE 1typedef int status;typedef int boolean;typedef int ElementType;#define MAX 100void view(Ele
2013-01-05 16:18:36
303
原创 堆排序和 优先队列
#include"head.h"static int left(int i){ return (i<<1);}static int right(int i){ return ((i<<1)+1);}static int parent(int i){ return (i/2);}void swap(ElementType *x,El
2012-12-30 15:34:38
222
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人