"Data structure" create two fork Tree

The input node is worth paying attention to!!!

To follow abc# #de #g# #f # # #的格式输入.

/* Two fork Tree 
*/
#include <stdio.h>

//Use two-fork list to store binary tree 
typedef struct bitnode{
	char data;
	struct Bitnode *lchild,*rchild;
} Bitnode,*bitree;

Sequence of sequential resumes binary linked list 
void Createbitree (Bitree &t) {
	//Enter binary tree node values in order of First order
	Char ch;
	scanf ("%c", &ch);
	if (ch== ' # ') {
		t=null;
	} else{
		t=new Bitnode;
		t->data=ch;
		Createbitree (t->lchild);
		Createbitree (T->rchild);
	}
}

void Inordertraverse (Bitree t) {
	if (t) {
		inordertraverse (t->lchild);
		printf ("%c", t->data);
		Inordertraverse (T->rchild);
	}
}

int main () {
	bitree T;
	Createbitree (T);
	Inordertraverse (T);
}