先序建二叉树写了个木马

[sinat_26083883]

。。。数据结构课没好好听，这周课程设计无奈试着学了一点，打算做个用二叉树把中缀表达式转换称前缀表达式的程序，结果360报错了，本身也不太懂，大神们帮忙分析下原因，能把程序做出来最好，代码

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define maxsize 80
typedef char Telemtype;
typedef struct Node{
	Telemtype data;
	struct Node *lchild;
	struct Node *rchild;
}Node,*Tree;
void Create(Tree T){
	char ch;
	T=(Tree)malloc(sizeof(Tree));
	scanf("%c",&ch);
	T->data=ch;
	T->lchild=NULL;
	T->rchild=NULL;
	
}
int createTree(Tree &T){
		char ch;
		scanf("%c",&ch);
		T->data=ch;
		Create(T->lchild);
		createTree(T->rchild);
}

void Preordertraverse(Tree T){
	if(T){
		Preordertraverse(T->lchild);
		printf("%c",T->data);
		Preordertraverse(T->rchild);
	}
}
int judge(char ch){
	if(ch=='+'||ch=='-'||ch=='*'||ch=='/'||ch=='('||ch==')')
	return 0;
}
int main()
{
	Tree K;
	createTree(K);
	Preordertraverse(K);
	return 0;
}