数据结构二叉树的链式存储

typedef struct BiTNode{int data;struct BiTNode *lchild, *rchild;}BiTNode, *BiTree;//定义一棵空树BiTree root = NULL;//插入根节点root = (BiTree)malloc(sizeof(BiTNode));root->data = {1};root->lchild = NULL;root->rchild = NULL;//插入新结点BiTNode *p = (BiTNode *)malloc(sizeof(BiTNode));p->data = {2};p->lchild = NULL;p->rchild = NULL;root->lchild = p;