c语言递归求二叉树的最小值,C语言，数据结构，二叉树的递归构造，求大神教导，使其正常运行。...

#include

#include

typedef char ElementType ;

struct binaryTreeNode

{

ElementType data;

struct binaryTreeNode *LeftChild,*RightChild;

};

typedef struct binaryTreeNode BinaryTreeNode;

void BTreeCreate(BinaryTreeNode **T)

{

char x;

scanf("%c",&x);

if(x == ' ')

(*T) = NULL;

else

{

(*T) = (BinaryTreeNode *)malloc(sizeof(BinaryTreeNode));

(*T)->data = x;

/*三行printf用于检验，发现下面printf语句会发生重复，我百思不得其解，求指导*/

printf("%d\n",(*T));

printf("%d\n",(*T)->LeftChild);

printf("%d\n",(*T)->RightChild);

BTreeCreate(&((*T)->LeftChild));

BTreeCreate(&((*T)->RightChild));

}

}

void PreOrder(BinaryTreeNode *t)

{

if(t)

{

printf("%c",t->data);

PreOrder(t->LeftChild);

PreOrder(t->RightChild);

}

}

void InOrder(BinaryTreeNode *t)

{

if(t)

{

InOrder(t->LeftChild);

printf("%c",t->data);

InOrder(t->RightChild);

}

}

void PostOrder(BinaryTreeNode *t)

{

if(t)

{

PostOrder(t->LeftChild);

PostOrder(t->RightChild);

printf("%c",t->data);

}

}

int main(void)

{

BinaryTreeNode *t;

BTreeCreate(&t);

printf("\n先序：");PreOrder(t);

printf("\n后序：");InOrder(t);

printf("\n中序：");PostOrder(t);

printf("\n");

return 0;

}

输入a，编译结果

输入空格，编译结果