建立二叉树算法

#include<iostream>
using namespace std;
typedef char elemtype;
typedef struct binode
{
	elemtype data;
	struct binode* lch, * rch;
}binode,*bitree;
bool createbitree(bitree& t)//先序遍历建立二叉树
{
	char ch;
	cin >> ch;
	if (ch == '#')
	{
		t = NULL;
	}
	else
	{
		if (!(t = new binode))
		{
			exit(-1);
		}
		t->data = ch;
		createbitree(t->lch);
		createbitree(t->rch);
	}
	return 1;
}







int main()
{
	return 0;
}