二叉树初探（学习中）

#include <iostream>
#include<stack>

using namespace std;

typedef struct TreeNode {
	char data;
	TreeNode *Tleft;
	TreeNode *Tright;
}*Root;
void createTree(Root &T) {
	char a;
	cin >> a;
	if (a == '#') {
		T = NULL;
	}
	else {
		T = new TreeNode;
		T->data = a;
		createTree(T->Tleft);
		createTree(T->Tright);
	}
}
void Traverse(Root T) {
	if (T) {
		cout << T->data << " ";
		Traverse(T->Tleft);
		Traverse(T->Tright);
	}
}
int main(){
	Root T;
	createTree(T);
	Traverse(T);
}