C语言课程设计：树与二叉树转换及遍历算法实现

#include<stdio.h>
#include<conio.h>
#include<malloc.h>
#include<string.h>
#include<stdlib.h>
#include<windows.h>
#define QUEUELENTH 100 //辅助队列长度
#define STACKLENTH 100 //辅助栈长度
char strChild[3][20] = { "root","left child","right child" };          //全局变量
struct TreeNode //一般树节点结构体孩子表示法
{
int num;
int childLenth;
TreeNode * children[10];
}*Root;//全局一般树根节点

struct BiTreeNode //二叉树节点结构体
{
int num;
BiTreeNode * LeftChild;
BiTreeNode * RightChild;
}*BiRoot;//全局二叉树根节点
//*****************************************************************************************************************************

//*****************************************************************************************************************************
//建树程序段

int CreateTreeNode(TreeNode *pt, int degree, int num) //递归建造一颗一般树
{
int number, i;

printf("degree : %-2d\nNo.%d : ", degree, num); //提示用户输入
scanf("%d", &pt->num);
printf("How much children it has(0 <= num <= 10) : ");
scanf("%d", &number);
if (num < 0 || num> 10)
{
printf("Error input !\n");
num = 0;
}
pt->childLenth = number;
for (i = 0; i < number; i++)
{
pt->children[i] = (TreeNode *)malloc(sizeof(TreeNode));
CreateTreeNode(pt->children[i], degree + 1, i + 1);
}
return 0;
}


int CreateTree() //建造树函数
{
char ch;
printf("\t\t\t1. Create a normal tree\n");

printf("\t\t\t2. Return\n");
ch = getchar();
getchar();
if (ch == '1')
{
Root = (TreeNode *)malloc(sizeof(TreeNode));