新模板_final_final.docxVIP

二叉树的遍历#includeusing namespace std;struct tree { char key; tree *left; tree *right;};tree *creat(string pre,string mid) //建树{ if(pre.size()=0) { return NULL; } tree *p; p=new tree[1]; p-key=pre[0]; int pos=mid.find(pre[0]); p-left=creat(pre.substr(1,pos),mid.substr(0,pos)); int len=mid.size()-pos-1; p-right=creat(pre.substr(pos+1,len),mid.substr(pos+1,len)); return p;}int print_post(tree *ROOT)//后序遍历{ if(ROOT==NULL) { return 0; } print_post(ROOT-left); print_post(ROOT-right); cout ROOT-key; return 0;}int print_forth(tree *ROOT)//前序遍历{ if(ROOT==NULL) { return 0; } cout ROOT-key; print_post(ROOT-left); print_post(ROOT-right); return 0;}//层次遍历（分级遍历）int PrintByLevel(tree *ROOT){ tree *temp[100];//存储每个节点的地址 int j; for(j=0; j100; j++) { temp[j]=NULL; } temp[0]=ROOT;//初始只有一个节点 即根节点 j=0; int t=1; while(temp[j]!=NULL) { if(temp[j]-left!=NULL) { temp[t++]=temp[j]-left; } if(temp[j]-right!=NULL) { temp[t++]=temp[j]-right; } couttemp[j]-key; j++; }}int main(){ string pre_order; string post_order; int n; cinn; while(n--) { tree *root; cinpre_orderpost_order; root=creat(pre_order,post_order); print_post(root); coutendl; PrintByLevel(root); coutendl;// print_forth(root);// coutendl;// print_mid(root);// coutendl; }}void dp_group(int m,int mmax,int start){ if(m==mmax) { key=flip(m); if(key) { fin_ans=m; } return ; } int i; for(i=start+1; i16; ++i) { point[m]=i; dp_group(m+1,mmax,i); if(key) break; }}int main(){ int i; int t=0; initial(); for(i=0; i4; ++i) { int j; for(j=0; j4; ++j) { cinmap[i][j]; arrmap[t++]=map[i][j]; } } arrmap[t]=0; f