skyfire1123的博客

#include #define maxn 1000 using namespace std; struct List{ int data[maxn]; int last; }; List *MakeEmpty(); int FindKth(int K,List *list); int Find(int X,List *list); void Insert(int X,int i,Lis

#include using namespace std; struct Node{ int Data; Node *Next; }; struct List{ Node *head; }; List MakeEmpty(){ List list; list.head=NULL; return list; } int Length(List *list){ Node *p;

#include #define maxn 1000 using namespace std; struct Stack{ int Data[maxn]; int Top; }; Stack *CreateStack(){ Stack *PtrS = (Stack*)malloc(sizeof(Stack)); PtrS->Top=-1; return PtrS; } void

#include using namespace std; struct Stack{ int Data; Stack *next; }; Stack *CreateStack(){ Stack *PtrS =(Stack*)malloc(sizeof(Stack)); PtrS->next=NULL; return PtrS; } void Push(Stack *PtrS,i

#include #define maxn 1000 #define NoFound -1 using namespace std; const int Record[]={5,16,39,45,51,98,100,202,226,321,368,444,501}; struct StaticTable{ int Data[maxn]; int Length; }; StaticTab

strcut BinTree{ ElementType Data; BinTree Left; BinTree Right; } //先序遍历递归法： void PreOrderTraversal(BinTree BT) { if(BT){ coutData; PreOrderTraversal(BT->Left); PreOrderTraversal(BT->Right);