摘要：#ifndef PRIORITYQUEUE_H#define PRIORITYQUEUE_Htemplate <class T>class PriorityQueue{private: T *x; int size,capacity; void swap(int i,int j) { T t=x[i];x[i]=x[j];x[j]=t; }public: PriorityQueue(int initCapacity) { capacity=initCapacity; x=new int[capacity+1];... 阅读全文

摘要：1 #ifndef STACK_H 2 #define STACK_H 3 4 #include<stdexcept> 5 #include<string> 6 using namespace std; 7 8 template<typename T> 9 class Stack10 {11 private:12 template<typename T>13 struct Node14 {15 T data;16 Node* next;17 Node(T data,Node* next):data(data),nex... 阅读全文

摘要：写了一个单链表的模板，欢迎大家批评指正。 1 #ifndef LINKEDLIST_H 2 #define LINKEDLIST_H 3 #define DEBUG 4 5 #include<iostream> 6 using namespace std; 7 8 template <typename T> 9 class LinkedList 10 { 11 public: 12 template<typename T> 13 struct Node 14 { 15 T data; 16 Node* next; 1... 阅读全文

摘要：1 #ifndef BSTREE_H 2 #define BSTREE_H 3 #include<cassert> 4 #include<stack> 5 using namespace std; 6 7 template<typename T> 8 class BSTree 9 { 10 public: 11 template<typename T> 12 struct Node{ 13 T data; 14 Node* lchild; 15 Node* rchild; 16 Node* p... 阅读全文