#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXSIZE 1024
//二叉树节点
typedef struct tNode{
char data;
tNode *lchild;
tNode *rchild;
}bitree;
//调用函数声明
bitree * Create();
int LayerTraverse();
int InOrder();
int PreOrder();
//建立二叉树
bitree * Create(){
char ch;
bitree *root,*s;
printf("Please input the char\nIf it's null input '@'\nEnd with '#'\n");
bitree *Q[MAXSIZE];
int front, rear;
root = NULL; front = 1; rear = 0;
getchar();
while ((ch = getchar())!='#')
{
s = NULL;
if (ch != '@'){
s = (bitree *)malloc(sizeof(bitree));
s->data = ch;
s->lchild = NULL;
s->rchild = NULL;
}
rear++;
Q[rear] = s;
if<
二叉树的建立与遍历(C语言简单实现)
最新推荐文章于 2025-05-16 11:57:26 发布