Binary tree traversal (first order traversal. Output results according to first order, middle order, and last order)

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

typedef char DataType;

typedef struct BiTNode {
	DataType data;
	struct BiTNode* lchild, * rchild;
}BiTNode, * BiTree;

BiTree CreateBiTree() {           // Create a binary tree （ Pre order creation ）
	BiTree T;
	char ch;
	scanf("%c", &ch);
	if (ch == '#') T = NULL;  // With ‘#’ Indicates that the location is empty 
	else {
		T = (BiTree)malloc(sizeof(BiTNode));
		T->data = ch;
		T->lchild = CreateBiTree();
		T->rchild = CreateBiTree();
	}
	return T;                // Return root node 
}

void PreOrderTraverse(BiTree T)		// Traversing a binary tree in order 
{
	if (!T) return;

	printf("%c", T->data);
	PreOrderTraverse(T->lchild);	// Recursively traverses the left subtree 
	PreOrderTraverse(T->rchild);	// Recursively traverses the right subtree 
}

void InOrderTraverse(BiTree T)		// Middle order ergodic binary tree 
{
	if (!T) return;

	InOrderTraverse(T->lchild);
	printf("%c", T->data);
	InOrderTraverse(T->rchild);
}

void RearOrderTraverse(BiTree T)	// Post order traversal binary tree 
{
	if (!T) return;

	RearOrderTraverse(T->lchild);
	RearOrderTraverse(T->rchild);
	printf("%c", T->data);
}

int main()
{
	BiTree T;
	printf(" Please input the binary tree in the first order , For vacant positions “#” Instead of ：\n");
	T = CreateBiTree();
	PreOrderTraverse(T);
	printf("\n");
	InOrderTraverse(T);
	printf("\n");
	RearOrderTraverse(T);
	return 0;
}

test result ：