吃苦胆的野狼

个人觉得书上写的函数太乱，自己整理后写了

#include#include#includeusing namespace std;struct BinTreeNode{ char data ; BinTreeNode *left ; BinTreeNode *right ;};//BinTree 类里所要书写的函数只有create，前中后序的遍历，所谓的visit函数class BinTree{ public:

#include#includeusing namespace std;//栈的实质定义是什么struct Node {int data ;Node *link ;Node (int sj ,Node *next) { data =sj ;// sj即数据link = next ;}};class Stack{protected:Node *top ;//top指针指的是栈顶public:Stac

这是通过邻接矩阵进行DFS#include#include #include#define Max_ver_num 20using namespace std ;bool visit[Max_ver_num] ;//这个数组的用途是标记struct HGraph{ string vexs [ Max_ver_num ] ; //放每个顶点的数组的名字 int arcs [Ma

#include#includeusing namespace std;struct Node { int data ; Node *link ; };class LinkList {public: LinkList () {} ; bool IsEmpty ( ) {return (first->link != NULL) ?false : true ;}