数据结构实验之二叉树二：遍历二叉树

数据结构实验之二叉树二：遍历二叉树

Time Limit: 1000MS Memory limit: 65536K

题目描述

输入

输出

示例输入

abc,,de,g,,f,,,

示例输出

cbegdfacgefdba

#include <iostream>#include <algorithm>#include <cstring>using namespace std;typedef struct node{char data;struct node *lchild,*rchild;} node,*tree;int xiancreat(tree &t);void inorder(tree t);void visit(tree t);void posorder(tree t);char c[60];int i;int main(){tree t;while(cin>>c){i=0;xiancreat(t);inorder(t);cout<<endl;posorder(t);cout<<endl;}}int xiancreat(tree &t){char a;a=c[i++];if(a==',')t=NULL;else{t=(tree)malloc(sizeof(node));if(!t) exit(0);t->data=a;xiancreat(t->lchild);//注意一直循环，也就一直循环输入xiancreat(t->rchild);}return 0;}void visit(tree t){if(t->data!=',')cout<<t->data;}void inorder(tree t){if(t!=NULL){inorder(t->lchild);visit(t);inorder(t->rchild);}}void posorder(tree t){if(t!=NULL){posorder (t->lchild);posorder (t->rchild);visit(t);}}