c_million的博客

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<string.h>#include"queue.h"int main(){ Queue line; Item temp; char ch; InitializeQueue(&line); puts("Te

/*二叉搜索树*//* 操作： *//* 操作前： *//* 操作后： */#ifndef _TREE_H#define _TREE_H#include<stdbool.h>typedef struct item{ char petname[20];/* 宠物名字*/ char petkind[20];/* 宠物种类*/}Item;#define MAXITEMS 1

#include<stdio.h>#include<stdlib.h>#include"queue.h"/*局部函数*/static void CopyToNode(Item item, Node *pn);static void CopyToItem(Node * pn, Item *pi);void InitializeQueue(Queue * pq){ pq->front

#ifndef _QUEUE_H#define _QUEUE_H#include<stdbool.h>/*在此处插入Item的类型定义*//*例如：*/typedef int Item;/*或：typedef struct item{...} Item*/#define MAXQUEUE 10typedef struct node{ Item item; struct

#define _CRT_SECURE_NO_WARNINGS#include<stdio.h>#include<stdlib.h>#include<time.h>#include"queue.h"#define MIN_PRE_HR 60.0/*有新顾客到来吗？*/bool newcustomer(double x); /*设置顾客参量*/Item customertime(lon

无摘要

#define _CRT_SECURE_NO_WARNINGS

#define _CRT_SECURE_NO_WARNNINGS

#include<stdio.h>

#define _CRT_SECURE_NO_WARNNINGS{ do

/*二叉树实现*/#include"tree.h"#include<stdlib.h>#include<stdio.h>#include<string.h>static SeekItem( const Item * pi, Tree * ptree);static Node * MakeNode(const Item * pi);static bool ToLeft(const I