Three traversals of binary tree in C language

#include <stdio.h>
#include <stdlib.h>

typedef struct BiTNode{
	char data;
	struct BiTNode *lchild,*rchild;
}BiTNode,*BiTree;

// The first sequence traversal  
void PreOrder(BiTree t){
	if(t!=NULL){
		printf("%c ",t->data);// Access the root node 
		PreOrder(t->lchild);  // Access the left node  
		PreOrder(t->rchild); // Access the right node  
	}
}

// In the sequence traversal  
void InOrder(BiTree t){
	if(t!=NULL){
		InOrder(t->lchild);  // Access the left node  
		printf("%c ",t->data);// Access the root node 
		InOrder(t->rchild); // Access the right node  
	}
}

// After the sequence traversal  
void PostOrder(BiTree t){
	if(t!=NULL){
		PostOrder(t->lchild);  // Access the left node  
		PostOrder(t->rchild); // Access the right node  
		printf("%c ",t->data);// Access the root node 
	}
}

// Count the total number of binary tree nodes 
int BiTreeLength(BiTree root)
{
	if(root==NULL) return 0;
	return 1+BiTreeLength(root->lchild) + BiTreeLength(root->rchild);
}

// Initialize the tree node  
void InitBiTree(BiTree &root){
	root=(BiTree)malloc(sizeof(BiTNode));
	root->data={'A'};
	root->lchild=root->rchild=NULL;
	
	BiTNode *p1=(BiTNode *)malloc(sizeof(BiTNode));
	p1->data={'B'};
	p1->lchild=p1->rchild=NULL;
	root->lchild=p1;
	
	BiTNode *p2=(BiTNode *)malloc(sizeof(BiTNode));
	p2->data={'C'};
	p2->lchild=p2->rchild=NULL;
	root->rchild=p2;
	
	BiTNode *p3=(BiTNode *)malloc(sizeof(BiTNode));
	p3->data={'D'};
	p3->lchild=p3->rchild=NULL;
	p1->lchild=p3;
	
	BiTNode *p4=(BiTNode *)malloc(sizeof(BiTNode));
	p4->data={'E'};
	p4->lchild=p4->rchild=NULL;
	p1->rchild=p4;
	
	BiTNode *p5=(BiTNode *)malloc(sizeof(BiTNode));
	p5->data={'F'};
	p5->lchild=p5->rchild=NULL;
	p2->lchild=p5;
	
	BiTNode *p6=(BiTNode *)malloc(sizeof(BiTNode));
	p6->data={'G'};
	p6->lchild=p6->rchild=NULL;
	p2->rchild=p6;
}

int main(){
	BiTree root=NULL;
	InitBiTree(root);
	PreOrder(root); 
	printf("\n");
	InOrder(root);
	printf("\n");
	PostOrder(root);
	printf("\n");
	int cnt=BiTreeLength(root);
	printf(" The node number of binary tree is ：%d\n",cnt);
	return 0;
}