二叉树递归遍历

void Traverse1(BinTree T){    if (T == NULL)  return;    printf("%c ",T->data);    Traverse1(T->lchild);    Traverse1(T->rchild);}void Traverse2(BinTree T){    if (T == NULL)  return;    Traverse2(T->lchild);    printf("%c ",T->data);        Traverse2(T->rchild);}void Traverse3(BinTree T){    if (T == NULL)  return;        Traverse3(T->lchild);    Traverse3(T->rchild);    printf("%c ",T->data);}