fktr_70的博客

avltree.h#ifndef _AVLTREE_H_#define _AVLTREE_H_struct AvlNode;typedef struct AvlNode* Position;typedef struct AvlNode* AvlTree;typedef int ElementType;AvlTree Insert(ElementType x, AvlTree T);Avl

hashtable.h#ifndef _HASHTABLE_H_#define _HASHTABLE_H_#define MinTableSize 10000#define Prime 10007typedef unsigned int Index;typedef Index Position;struct HashTbl;typedef struct HashTbl* HashTabl

binqueue.h#ifndef _BINQUEUE_H_#define _BINQUEUE_H_#define MaxTrees 100#define Capacity 1000struct BinNode;struct Collection;typedef int ElementType;typedef struct BinNode *Position;typedef Posit

binheap.h#ifndef _BINHEAP_H_#define _BINHEAP_H_#define MinPQSize 100struct HeapStruct;typedef int ElementType;typedef struct HeapStruct *PriorityQueue;PriorityQueue Initialize(int MaxElements);vo

leftheap.h#ifndef _LEFTHEAP_H_#define _LEFTHEAP_H_#define Insert(X,H) (H=Insert1((X),H))#define DeleteMin(H)(H=DeleteMin1(H))struct TreeNode;typedef struct TreeNode *PriorityQueue;typedef int Elem

skewheap.h#ifndef _SKEWHEAP_H_#define _SKEWHEAP_H_#define Insert(X,H) (H=Insert((X),H))struct TreeNode;typedef struct TreeNode *PriorityQueue;typedef int ElementType;PriorityQueue Initialize();Ele

hashtable.h#ifndef _HASHTABLE_H_#define _HASHTABLE_H_#define MinTableSize 100#define Prime 10007struct ListNode;typedef struct ListNode* Position;struct HashTbl;typedef struct HashTbl* HashTable;

list.h#ifndef _LIST_H_#define _LIST_H_#define SpaceSize 100typedef int PtrToNode;typedef PtrToNode List;typedef PtrToNode Position;typedef int ElementType;int IsEmpty(const List L);int IsLast(con

#ifndef _PACKAGE_H_#define _PACKAGE_H_//数组实现namespace list_in_array{ template<typename T> class List { private: enum { bad = -1 }; enum { MAX = 100 }; T elem

stack.h#ifndef STACK_H_#define STACK_H_struct Node;typedef struct Node * PtrToNode;typedef PtrToNode Stack;typedef int ElementType;int IsEmpty(Stack S);Stack CreateStack();void MakeEmpty(Stack S)

#ifndef _STACK_H_#define _STACK_H_//数组实现namespace stack_in_array{ template <typename T> class Stack { private: enum { MAX = 100 }; T elements[MAX]; int top;

#ifndef _PACKAGE_H_#define _PACKAGE_H_//链表实现namespace queue_in_list{ template<typename T> class Queue { private: struct Node { T data; struct

list.h#ifndef _LIST_H_#define _LIST_H_struct Node;typedef int ElementType;typedef struct Node *PtrToNode;typedef PtrToNode List;typedef PtrToNode Position;List MakeEmpty(List L);int IsEmpty(List

bsttree.h#ifndef _BSTTREE_H_#define _BSTTREE_H_struct BstNode;typedef int ElementType;typedef struct BstNode *Position;typedef struct BstNode *BstTree;BstTree MakeEmpty(BstTree T);Position Find(E

disjset.h#ifndef _DisjSet_H_#define _DisjSet_H_#define NumSets 100typedef int DisjSet[NumSets + 1];typedef int SetType;typedef int ElementType;void Initialize(DisjSet S);void SetUnion(DisjSet S, S