数据结构二叉树的创建（c语言版）

如题所述

//输入的格式为:abd##e##c##

#include "stdlib.h"

typedef int Element;

struct Tree
{
Element data;
struct Tree *left;
struct Tree *right;
};

void CreateBinSortTree(struct Tree **t);
void InsertNode2Tree(struct Tree **root, Element num);

void PrintTree(struct Tree *r, int order);

int main(int argc, char* argv[])
{
printf("请输入一组字母(#表示子树为空)\n");
struct Tree *t=NULL;
CreateBinSortTree(&t);

printf("\n根左右:");
PrintTree(t,1);

printf("\n左根右:");
PrintTree(t,2);

printf("\n左右根:");
PrintTree(t,3);

printf("\n");
return 0;
}

void CreateBinSortTree(struct Tree **t)
{
char ch;
ch = getchar();
if (ch == '#')
{
*t = NULL;
return ;
}
*t = (struct Tree *)malloc(sizeof(struct Tree));
(*t)->data = ch;
CreateBinSortTree( &((*t)->left));
CreateBinSortTree( &((*t)->right));

}

void PrintTree(struct Tree *r, int order)
{
if (r == NULL)
{
return ;
}
switch(order)
{

case 1:
printf("%c ",r->data);
PrintTree(r->left,order);
PrintTree(r->right,order);
break;
case 2:
PrintTree(r->left,order);
printf("%c ",r->data);
PrintTree(r->right,order);
break;
case 3:
PrintTree(r->left,order);
PrintTree(r->right,order);
printf("%c ",r->data);
break;
}

}

温馨提示：内容为网友见解，仅供参考

当前网址：https://11.t2y.org/zz/smfsf47vf.html