树的模型
输出结果
先序建立
#include<iostream>
using namespace std;
#define ElemType char
struct MyStruct
{
ElemType data;
MyStruct* left;
MyStruct* right;
};
void creat(MyStruct* &tree)//建立二叉树
{
MyStruct* k;
char c;
cin >> c;
if (c != '#')//如果不为'#'则放入
{
tree = (MyStruct*)malloc(sizeof(MyStruct));
tree->data = c;
creat(tree->left);//左递归