求大佬帮助~~

#include<stdio.h>
#include<malloc.h>
//构造结点
typedef struct BTNODE
{
char data;
struct BTNode *LChild;
struct BTNode *RChild;
}Node;
//函数声明
Node * InitBiTree(void);
//主函数
int main(void)
{
Node * pT =InitBiTree();
return 0;
}
//创建二叉树
Node * InitBiTree(void)
{
Node * pA = (Node *)malloc(sizeof(Node));
Node * pB = (Node *)malloc(sizeof(Node));
Node * pC = (Node *)malloc(sizeof(Node));
Node * pD = (Node *)malloc(sizeof(Node));
Node * pE = (Node *)malloc(sizeof(Node));
Node * pF = (Node *)malloc(sizeof(Node));
Node * pG = (Node *)malloc(sizeof(Node));
Node * pH = (Node *)malloc(sizeof(Node));
pA->data='A';
pB->data='B';
pC->data='C';
pD->data='D';
pE->data='E';
pF->data='F';
pG->data='G';
pH->data='H';
pA->LChild = pB;
pB->LChild=pD; pB->RChild=NULL;
pC->LChild=pE; pC->RChild=pF;
pD->LChild=pD->RChild=NULL;
pE->LChild=pE->RChild=NULL;
pF->LChild=pG; pF->RChild=NULL;
pG->LChild=pH; pG->RChild=NULL;
pH->LChild=pH->RChild=NULL;
return pA;
}