摘要： 代码：#include <iostream>#include<stack>#include<queue>#include<cstdio>#include<cstring>using namespace std;typedef struct Node{ char data; int le; Node * left,*right; Node(){le=0;}}BinTreeNode;class BinTree{private: BinTreeNode *root; int maxle;public: BinTree(){ cout< 阅读全文

摘要： 代码：//这个不是我的代码//链表表示集合，求两个集合交集 Intersection()#include<iostream>using namespace std;template<class T>//链表结点struct SLNode{ T data;//数据 SLNode<T> *next;//指针 SLNode(SLNode * nextNode = NULL){next = nextNode;} SLNode(const T& item, SLNode * nextNode = NULL){data = item; next = nextNo 阅读全文