R_Misaya的专栏

#include #include #include #include #include using namespace std; char s1[100],s2[100],ans[100]; typedef struct BiTNode { char data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; void build(BiTr

#include//二叉树的建立，遍历算法（非递归），递归在其他代码中，深度算法，叶子节点个数算法。 #include #include using namespace std; typedef struct tree { char data; struct tree *lchild,*rchild; }tree,*bitree; typedef struct post { bitre

#include #include using namespace std; void build(int n,char *s1,char *s2,char *s) { if(n<=0) return; int p =strchr(s2,s1[0])-s2; build(p,s1+1,s2,s); build(n-p-1,s1+p+1,s2+p+1,s+p); s[n-1]=s1[0]

#include using namespace std; int f; typedef struct BiTNode { int data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; void visit(BiTree T) { if(T->data!=NULL) { if(f==1) { coutdata; }

#include #include using namespace std; char c[100],d[100]; int o=0,e=0; typedef struct bitnode { char data; struct bitnode *lchild,*rchild; }bitnode,*bitree; void insert(bitree &t1,char key) { if(t

#include #include int cont; char st1[100],st2[100],ans[100]; void build(int n,char *s1,char *s2,char *s) { if(n<=0) return; int p=strchr(s1,s2[n-1])-s1; ans[cont++]=s2[n-1]; build(p,s1,s2

#include #include using namespace std; typedef struct BiTNode { char data; struct BiTNode *lchild,*rchild; }BiTNode, *BiTree; int Create(BiTree &T) { char data; cin>>data; if(data==','){ T=NULL;}

#include #include #define N 30000 using namespace std; int a[N+1],o=0; typedef struct { int weight; int parent,lchild,rchild; }htnode; typedef struct { int weight; }htcode; void huffmanselect(htno

#include #include #include using namespace std; char s1[100],s2[100]; typedef struct BiTNode { char data; struct BiTNode *lchild,*rchild; }BiTNode,*BiTree; void build(BiTree &T,char *s1,char *s2,int