二叉树的创建，和三种递归遍历方式

在运行窗口输入：

 A B D # # F E # # # C G # H # # I # #

#include <stdio.h>
#include <stdlib.h>

typedef char ElementType;
typedef struct TNode *Position;
typedef Position BinTree;    //二叉树类型
struct TNode {
    ElementType Data;    //结点数据
    BinTree Left;        //指向左子树
    BinTree Right;        //指向右子树
};

void printBinTree(BinTree BT, int Depth);


BinTree CreateBinaryTree(BinTree BT)
{
    char dt;
    //printf("please enter a character: ");
    scanf_s("%c", &dt);
    getchar();
    if (dt == '#')
        return NULL;
    else
    {
        if (!BT)
        BT = (BinTree)malloc(sizeof(struct TNode));
        BT->Data = dt;
        BT->Left = NULL;
        BT->Right = NULL;
        //printf("please enter the left son of %c: ", dt);
        BT->Left = CreateBinaryTree(BT->Left);
        //printf("please enter the right son of %c: ", dt);
        BT->Right = CreateBinaryTree(BT->Right);
        return BT;
    }
    
}



void InorderTraversal(BinTree BT, int Depth)
{
    if (BT)
    {
        printBinTree(BT, Depth);
        InorderTraversal(BT->Left, Depth + 1);
        InorderTraversal(BT->Right, Depth + 1);
        
        //printf("%c", BT->Data);
        
    }
}

void printBinTree(BinTree BT, int Depth)
{
    for (int i = 0; i < Depth; i++)
        printf("  ");
    printf("%c
", BT->Data);
}

int main()
{
    BinTree BT = (BinTree)malloc(sizeof(struct TNode));
    BT = CreateBinaryTree(BT);
    InorderTraversal(BT, 0);
}