设计一个完整的程序,实现二叉树的各种算法

实验6 实验目的：

1、掌握二叉树的所有算法

2、熟悉计算机英语和术语

实验步骤：

1、二叉树算法的模拟

2、完型填空

3、翻译

具体要求：

一、设计一个完整的程序，实现二叉树的各种算法

要求：/*用函数实现如下二叉排序树算法：

（1）插入新结点

（2）前序、中序、后序遍历二叉树

（3）中序遍历的非递归算法

（4）层次遍历二叉树

（5）在二叉树中查找给定关键字(函数返回值为成功1,失败0) （6）交换各结点的左右子树

（7）求二叉树的深度

（8）叶子结点数

输入：

第一行：准备建树的结点个数n

第二行：输入n个整数，用空格分隔

第三行：输入待查找的关键字

第四行：输入待查找的关键字

第五行：输入待插入的关键字

输出：

第一行：二叉树的先序遍历序列

第二行：二叉树的中序遍历序列

第三行：二叉树的后序遍历序列

第四行：查找结果

第五行：查找结果

第六行~第八行：插入新结点后的二叉树的先、中、序遍历序列第九行：插入新结点后的二叉树的中序遍历序列(非递归算法) 代码：

#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 int KeyType;

#define STACK_INIT_SIZE 100 // 存储空间初始分配量

#define STACKINCREMENT 10 // 存储空间分配增量

#define MAXQSIZE 100

typedef int ElemType;

typedef struct BiTNode{

ElemType data;

struct BiTNode *lchild,*rchild;//左右孩子指针

} BiTNode,*BiTree;

Status SearchBST(BiTree T,KeyType key,BiTree f,BiTree &p)

{

if(!T){p=f;return FALSE;}

else if(key==T->data){p=T;return TRUE;}

else if(keydata)return SearchBST(T->lchild,key,T,p);

else return(SearchBST(T->rchild,key,T,p));

}

Status InsertBST(BiTree &T,ElemType e)

{

BiTree s,p;

if(!SearchBST(T,e,NULL,p))

{

s=(BiTree)malloc(sizeof(BiTNode));

s->data=e;s->lchild=s->rchild=NULL;

if(!p)T=s;

else if(edata)p->lchild=s;

else p->rchild=s;

return TRUE;

}

else return FALSE;

}

Status PrintElement( ElemType e ) { // 输出元素e的值

printf("%d ", e );

return OK;

}// PrintElement

Status PreOrderTraverse( BiTree T, Status(*Visit)(ElemType) ) { // 前序遍历二叉树T的递归算法，对每个数据元素调用函数Visit。

//补全代码,可用多个语句

if(T)

{

if(Visit(T->data))

if(PreOrderTraverse(T->lchild,Visit))

if(PreOrderTraverse(T->rchild,Visit))return OK;

return ERROR;

}

else return OK;

} // PreOrderTraverse

Status InOrderTraverse( BiTree T, Status(*Visit)(ElemType) )

{

// 中序遍历二叉树T的递归算法，对每个数据元素调用函数Visit。

//补全代码,可用多个语句

if(T)

{

if(InOrderTraverse(T->lchild,Visit))

if(Visit(T->data))

if(InOrderTraverse(T->rchild,Visit))

return OK;

return ERROR;

}

else return OK;

} // InOrderTraverse

Statu s PostOrderTraverse( BiTree T, Status(*Visit)(ElemType) ) { // 后序遍历二叉树T的递归算法，对每个数据元素调用函数Visit。

//补全代码,可用多个语句

if(T)

{

if(PostOrderTraverse(T->lchild,Visit))

if(PostOrderTraverse(T->rchild,Visit))

if(Visit(T->data))return OK;

return ERROR;

}

else return OK;

} // PostOrderTraverse

Status Putout(BiTree T)

{

PreOrderTraverse(T,PrintElement);

printf("\n");

InOrderTraverse(T, PrintElement);

printf("\n");

PostOrderTraverse(T,PrintElement);

printf("\n");

return OK;

}

//·······················非递归算法

struct SqStack

{

BiTree *base; // 在栈构造之前和销毁之后，base的值为NULL

BiTree *top; // 栈顶指针

int stacksize; // 当前已分配的存储空间，以元素为单位

}; // 顺序栈

Status InitStack(SqStack &S)

{

S.base=(BiTree *)malloc(STACK_INIT_SIZE*sizeof(BiTree));

if(!S.base)return ERROR;

S.top=S.base;

S.stacksize=STACK_INIT_SIZE;

return OK;

}

Status Push(SqStack &S,BiTree e)

{

if((S.top-S.base)>=S.stacksize)

{

S.base=(BiTree*)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(BiTree));

if(!S.base)return ERROR;

S.top=S.base+S.stacksize;

S.stacksize+=STACKINCREMENT;

}

*S.top++=e;

return OK;

}

Status Pop(SqStack &S,BiTree &e)

{

if(S.top==S.base)return ERROR;

e=*--S.top;

return OK;

}

Status StackEmpty(SqStack S)

{ // 若栈S为空栈，则返回TRUE，否则返回FALSE

if(S.top-S.base==0)return TRUE;

else return FALSE;

}

Status InOrderTraverse1(BiTree T,Status(*Visit)(ElemType e),SqStack S) {

BiTree p;

InitStack(S);p=T;

while(p||!StackEmpty(S))

{

if(p){Push(S,p);p=p->lchild;}

else

{

Pop(S,p);

if(!Visit(p->data))return ERROR;

p=p->rchild;

}

}

return OK;

}

//···························层次遍历

typedef struct

{

BiTree *base; // 初始化的动态分配存储空间

int front; // 头指针,若队列不空,指向队列头元素

int rear; // 尾指针,若队列不空,指向队列尾元素的下一个位置

}SqQueue;

Status InitQueue(SqQueue &Q)

{

Q.base=(BiTree*)malloc(MAXQSIZE*sizeof(BiTree));

if(!Q.base)return ERROR;

Q.front=Q.rear=0;

return OK;

}

int QueueLength(SqQueue Q)

{

// 返回Q的元素个数

// 请补全代码

return(Q.rear-Q.front+MAXQSIZE)%MAXQSIZE;

}

Status EnQueue(SqQueue &Q,BiTree e)

{

// 插入元素e为Q的新的队尾元素

// 请补全代码

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,BiTree &e)

{

// 若队列不空, 则删除Q的队头元素, 用e返回其值, 并返回OK; 否则返回ERROR // 请补全代码

if(Q.front==Q.rear)return ERROR;

e=Q.base[Q.front];

Q.front=(Q.front+1)%MAXQSIZE;

return OK;

}

Status LevelTraverse(BiTree T,SqQueue Q)//层次遍历二叉树

{

InitQueue(Q);

BiTree p;

p=T;

if(T)EnQueue(Q,T);

// printf("%d",QueueLength(Q));

while(QueueLength(Q)!=0)

{

DeQueue(Q,p); //根结点出队

printf("%d ",p->data); //输出数据

if(p->lchild)EnQueue(Q,p->lchild); //左孩子进队

if(p->rchild)EnQueue(Q,p->rchild); //右孩子进队

}

return OK;

}

void Change(BiTree T)

{

BiTNode *p;

if(T)

{p=T->lchild;

T->lchild=T->rchild;

T->rchild=p;

Change(T->lchild);

Change(T->rchild);

}

// return OK;

}

int BTreeDepth(BiTree T)

//求由BT指针指向的一棵二叉树的深度{

// int dep1,dep2;

if(T!=NULL)

{

//计算左子树的深度

int dep1=BTreeDepth(T->lchild); //计算右子树的深度

int dep2=BTreeDepth(T->rchild); //返回树的深度

if(dep1>dep2)

return dep1+1;

else

return dep2+1;

}

else return 0;

}

//`````````````叶子结点数

Status yezhi(BiTree T,SqQueue Q)

{

int i=0;

InitQueue(Q);

BiTree p;

p=T;

if(T)EnQueue(Q,T);

// printf("%d",QueueLength(Q));

while(QueueLength(Q)!=0)

{

DeQueue(Q,p);

if(p->lchild)EnQueue(Q,p->lchild);

if(p->rchild)EnQueue(Q,p->rchild);

if(!p->lchild&&!p->rchild)

i++;

}

return i;

}

int main() //主函数

{

SqStack S;

SqQueue Q,Q3;

BiTree T=NULL,f,p;

int i,n,e,a,b,c;

scanf("%d",&n);

for(i=0;i

{

scanf("%d",&e);

InsertBST(T,e);

}

scanf("%d",&a);scanf("%d",&b);

scanf("%d",&c);Putout(T);

printf("%d\n",SearchBST(T,a,f,p));

printf("%d\n",SearchBST(T,b,f,p));

InsertBST(T,c);

Putout(T);

InOrderTraverse1(T, PrintElement,S);

printf("\n");

LevelTraverse(T,Q);

printf("\n");

Change(T);

Putout(T);

Change(T);

Putout(T);

printf("%d",BTreeDepth(T));

printf("\n");

printf("%d",yezhi(T,Q3));

printf("\n");

return OK;

}//main

完型填空

There are many kinds of Computer languages. A typical imperative language contains an (1)_ sub language which approximates the mathematical abstractions of" timeless" functions applied to "space- less" values, where the actual operation sequences and use Of storage space during

expression evaluation are organized behind the (2).

In this setting, values are data structures of low volume, typically a few computer words or less, which means that an illusion of (3) can be realized by having intermediate

re- suits during expression evalution stored at the

discretion of the language implementation, and

effecting pa- rameter (4)and (5)operations through value copying.

(1) A. applicative B. mandatory

C. application

D. voluntary

(2) A. screen B. background

C. foreground

D. scenes

(3) A. spaceful B. spacelessness

C. spaceless

D. space

(4) A. transportation B. tranverse

C. transmission

D. translation

(5) A. assignment B. dispatch

C. value

D. design

四翻译

Query By Example (QBE)

In database management programs ,a query technique ,developed by IBM for use in the QBE program ,that prompts you to

type the search criteria into a template resembling the data record .The advantage of query-by-example retrieval is that you

don’t need to learn a query language to frame a query .When you start the search ,the program presents a screen that lists all

the data fields that appear on every data record ;enter information that restricts the search to just the specified criteria .The

fields lift bland ,however ,will match anything.

Query Language

In database management programs ,a retrieval and data-editing language you use to specify what information to retrieve and

how to arrange the retrieved information on-screen or when printing .The dot-prompt language of dBASE is a full-fledged

query language ,as is Structured Query Language (SQL) ,which is used for minicomputer and mainframe databases and is

growing in popularity in the world of personal computers .The ideal query language is a natural language ,such as English. ARPAnet

A wide area network (WAN) .A network that connected Department of Defense research sites across America. Created in

1969 with funding from the Advanced Research Projects Agency (ARPA) .Undergoing constant research and development in

the early-to mid-1970s,ARPAnet served as the test bed for the development of TCP/IP( the protocols that make the Internet possible ).A Major goal of the ARPAnet project was to increase the military's command and control capability by enabling communication across a variety of physically dissimilar media ,including satellites .An allied goal was to create a robust

network capable of withstanding outages ,such as those that might result from a nuclear exchange .ARPAnet met these objectives ,but it also surprised its creators :It was found in short order that most ARPAnet users preferred to use the network for communication ,such as electronic mail and discussion groups .Initially ,the ARPAnet was available only to government research institutes and to universities holding Department of Defense (DoD) research contracts .In 1983,ARPAnet was divided into a high-security military network (Milnet )and an ARPAnet that was recast as a research and development network .Although it formed the foundation of the Internet ,it was decommissioned in 1990.