大连做企业网站排名,萍乡建站公司,网上商城英文,wordpress 修改header/*
给出一棵满二叉树的先序遍历#xff0c;有两种节点#xff1a;字母节点#xff08;A-Z#xff0c;无重复#xff09;和空节点#xff08;##xff09;。要求这个树的中序遍历。输出中序遍历时不需要输出#。
满二叉树的层数n满足1n5。Sample Input:
ABC#D#ESa… /*
给出一棵满二叉树的先序遍历有两种节点字母节点A-Z无重复和空节点#。要求这个树的中序遍历。输出中序遍历时不需要输出#。
满二叉树的层数n满足1n5。Sample Input:
ABC#D#ESample Output:
CBADE
*/
#includecstdio
#includecmath
#includecstring
#includeiostream
using namespace std;
const int M1024;
char data[M];
int layer;struct node
{char data;struct node *l;struct node *r;
};void build(node * t,int l)
{if(llayer)return ;int i0;while(data[i]\0)i;char tcdata[i];//coutiendltcendl;data[i]\0;if(tc#){tNULL;return ;}tnew node();t-datatc;build(t-l,l1);build(t-r,l1);
}void display(node *t)
{if(tNULL)return ;display(t-l);printf(%c,t-data);display(t-r);
}int main()
{/*printf(%d\n,(int)(log(8)/log(2)));printf(%f\n,(log(7)/log(2)));*/memset(data,\0,sizeof(data));while(scanf(%s,data)){//printf(%s\n,data);int nstrlen(data)1;/*if(log(n)/log(2)(int)(log(n)/log(2)))layer(int)(log(n)/log(2))1;else*/layer(int)(log(n)/log(2));//printf(%d\n,layer);node *tree;build(tree,1);display(tree);}return 0;
} tzHZAU 2019/3/13转载于:https://www.cnblogs.com/acm-icpcer/p/10525989.html
