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

SDUT原题：点击打开链接

#include <iostream>
#include <stdlib.h>
using namespace std;

char ch[100];
int cnt;
struct node
{
char data;
struct node * lchild;
struct node * rchild;
};

struct node * creat()
{
struct node * root;
if(ch[++cnt] == ',')
root = NULL;
else
{
root = (struct node * )malloc(sizeof(struct node));
root->data = ch[cnt];
root->lchild = creat();
root->rchild = creat();
}
return root;
};

void zhongxu(struct node * root)
{
if(root)
{
zhongxu(root->lchild);
cout << root->data;
zhongxu(root->rchild);
}
}

void houxu(struct node * root)
{
if(root)
{
houxu(root->lchild);
houxu(root->rchild);
cout << root->data;
}
}

int main()
{
struct node * root;
while(cin >> ch)
{
cnt = -1;
root = creat();
zhongxu(root);
cout << endl;
houxu(root);
cout << endl;
}
return 0;
}