SWUST data structure -- preorder traversal to create inorder traversal of binary trees

#include<iostream>
using namespace std;

struct Tree
{
	char data;
	Tree *l,*r;
};

void Init(Tree *&T)
{
	char str;
	cin>>str;
	if(str!='#')
	{
		T = new Tree;
		T->data=str;
		Init(T->l);
		Init(T->r);
	}
	else T=NULL;
}
void Dot(Tree *&T)
{
	if(T->l) Dot(T->l);
	if(T) cout<<T->data;
	if(T->r) Dot(T->r);
	
}
intmain()
{
	Tree *T;
	Init(T);
	Dot(T);
	return 0;
}