二叉树前序、中序、后序递归遍历实现（C语言）

void preTreverse(struct BTree *T)//前序遍历{    if(T)    {        printf("%d ",T->data);        preTreverse(T->left);        preTreverse(T->right);    }}void inTreverse(struct BTree *T)//中序遍历{    if(T)    {        inTreverse(T->left);        printf("%d ",T->data);        inTreverse(T->right);    }}void postTreverse(struct BTree *T)//后序遍历{    if(T)    {        postTreverse(T->left);        postTreverse(T->right);        printf("%d ",T->data);    }}