C语言 数据结构 实验四
8606 - 二叉树的构建及遍历操作
#include "stdio.h"
#include "malloc.h"
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;
typedef char ElemType;
typedef struct BiTNode
{
ElemType data;
struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;
Status CreateBiTree(BiTree &T)
{
char ch;
scanf("%c", &ch);
if (ch == '#') T = NULL;
else
{
if(!(T = (BiTNode *)malloc(sizeof(BiTNode)))) return ERROR;
T->data = ch;
CreateBiTree(T->lchild);
CreateBiTree(T->rchild);
}
return OK;
}
Status PrintElement(ElemType e)
{
printf("%c", e);
return OK;
}
Status PreOrderTraverse(BiTree T, Status(*Visit)(ElemType))
{
Visit = PrintElement;
if(T)
{
Visit(T->data);
PreOrderTraverse(T->lchild, PrintElement);
PreOrderTraverse(T->rchild, PrintElement);
}
else
{
return FALSE;
}
return TRUE;
}
Status InOrderTraverse(BiTree T, Status(*Visit)(ElemType))
{
Visit = PrintElement;
if(T)
{
InOrderTraverse(T->lchild, PrintElement);
Visit(T->data);
InOrderTraverse(T->rchild, PrintElement);
}
else
{
return FALSE;
}
return TRUE;
}
Status PostOrderTraverse(BiTree T, Status(*Visit)(ElemType))
{
Visit = PrintElement;
if(T)
{
PostOrderTraverse(T->lchild, PrintElement);
PostOrderTraverse(T->rchild, PrintElement);
Visit(T->data);
}
else
{
return FALSE;
}
return TRUE;
}
int main()
{
BiTree T = NULL;
CreateBiTree(T);
PreOrderTraverse(T, PrintElement);
printf("\n");
InOrderTraverse(T, PrintElement);
printf("\n");
PostOrderTraverse(T, PrintElement);
printf("\n");
}
8607 - 实现二叉排序树的各种算法(1)
#include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
#define OVERFLOW -2
typedef int Status;
typedef enum {
Link,Thread} pointerTag;
typedef int ElemType;
typedef struct _BiTNode
{
ElemType data;
struct _BiTNode *lchild, *rchild;
pointerTag ltag, rtag;
}BiTNode, *BiTree;
BiTree preNode;
typedef BiTree QElemType;
#define MAXQSIZE 100
typedef struct
{
QElemType *base;
int front;
int rear;
}SqQueue;
Status InitQueue(SqQueue &Q)
{
if(!(Q.base = (QElemType *)malloc(sizeof(QElemType) * MAXQSIZE)))
return ERROR;
Q.front = Q.rear = 0;
return OK;
}
Status EnQueue(SqQueue &Q, QElemType e)
{
if((Q.rear+1)%MAXQSIZE == Q.front)
return ERROR;
Q.base[Q.rear] = e;
Q.rear = (Q.rear+1)%MAXQSIZE;
return OK;
}
Status DeQueue(SqQueue &Q, QElemType &e)
{
if(Q.rear == Q.front)
return ERROR;
e = Q.base[Q.front];
Q.front = (Q.front+1)%MAXQSIZE;
return OK;
}
Status Insert(BiTree &T)
{
BiTree inputNode, traverseNode;
ElemType e;
scanf("%d", &e);
if(!T)
{
if(!(T = (BiTree)malloc(sizeof(BiTNode))))
{
return ERROR;
}
T->data = e;
T->lchild = NULL;
T->rchild = NULL;
T->ltag = Link;
T->rtag = Link;
return OK;
}
else
{
if(!(inputNode = (BiTree)malloc(sizeof(BiTNode))))
{
return ERROR;
}
inputNode->data = e;
inputNode->lchild = NULL;
inputNode->rchild = NULL;
inputNode->ltag = Link;
inputNode->rtag = Link;
traverseNode = T;
}
while(TRUE)
{
if(inputNode->data < traverseNode->data)