摘要：
#include <iostream>#include <deque>#include <stack>using namespace std;struct BSTNode{int data;BSTNode * LChild,* RChild;};class BST{private:BSTNode *T;public:~BST();BSTNode * GetRoot();void BSTCreate();void BSTInsert(BSTNode *);int BSTDepth(BSTNode *);//求树的深度 递归void Depth();//树的深度 阅读全文
摘要：
#include<iostream>#include <iomanip>#include <string>#include<deque>using namespace std;const int MAXSIZE=20;class node {public:void operator =(node b);int key;char info;};void node::operator=(node b){key=b.key;info=b.info;}struct Sqlist{node data[MAXSIZE+1];int length;};clas 阅读全文