#include<cstdio>int numberofnode;struct treenode{ int val; treenode *left; treenode *right; void setValue(int data) { val=data; left=NULL; right=NULL; }};void constructTree(treenode node[],int n){ int i; int data; char ischild; int childindex; for(i=0;i<n;++i)//n个结点 { scanf("%d",&data); node[i].setValue(data); } for(i=0;i<n;++i)//n个结点 { scanf("\n%c",&ischild);//加\n与不加有区别:在用"%c"输入时,空格和“转义字符”均作为有效字符。我们每击打一下"Enter"键,向键盘缓冲区发去一个“回车”(\r),一个“换行"(\n) switch(ischild)//每个case不加break将顺序执行语句 { case 'd': scanf("%d",&childindex); node[i].left=&node[childindex-1]; scanf("%d",&childindex); node[i].right=&node[childindex-1]; break; case 'l': scanf("%d",&childindex); node[i].left=&node[childindex-1]; break; case 'r': scanf("%d",&childindex); node[i].right=&node[childindex-1]; break; } }}void mirrorTree(treenode *node){ if(node==NULL||(node->left==NULL&&node->right==NULL)) return; treenode *tempnode; tempnode=node->left; node->left=node->right; node->right=tempnode; mirrorTree(node->left); mirrorTree(node->right);}void printTree(treenode *node)//按指定格式输出{ if(node==NULL) return; if(numberofnode-->1) printf("%d ",node->val); else printf("%d\n",node->val); printTree(node->left); printTree(node->right);} int main(){ int n; treenode node[1000]; while(scanf("%d",&n)!=EOF) { if(0==n) printf("NULL\n"); else { numberofnode=n; constructTree(node,n); mirrorTree(node); printTree(node); } } return 0;} /************************************************************** Problem: 1521 User: road Language: C++ Result: Accepted Time:0 ms Memory:1020 kb****************************************************************/