二叉排序树的基本操作的实现

1、participation in and contribution to the organizational accident investigation unit leadership, supervision of "four no" (the cause of the accident is not clear left off; those responsible for the accident and should be educated without education left off; responsible for the accidents did

2、 not address left off; do not take preventive measures did not miss) the implementation of the principle of completed accident statistics, analysis, reporting and evaluation comments; (F) to contribute to the safety recommendations or observations for the granting of recognition, reward; to have tho

3、se responsible for the accident, criticism and punishment recommendations or opinions; (VII) participation in engineering and project design review, construction team qualification and acceptance, and work relating to scientific research achievement appraisal. 23rd: safety supervisory personnel term

4、s of reference: (a) the right to enter production areas, construction sites, control rooms, control room to examine the security situation; (B) the right to prevent illegal operations, in violation of, acts in violation of production labor discipline; (C) the right to request the protection of the s

5、cene of the accident; the right to investigate the accident to any person within the company and extract raw data; right to take pictures of the accident scene, sound recordings, videos, etc; (D) survey of accident analysis and dealing with different opinions, reflect the right to deliver to the sup

6、ervisor or security oversight bodies; for violations of rules, procedures, hide or impede the investigation of the accident is entitled to reflect corrected or leapfrog. The fifth Festival rules and regulations article 24th: units of the company to the State and relevant safety regulations issued by

7、 the superior, standards, regulations, procedures, systems, accident prevention measures must be strictly implemented. Units may formulate rules in practice in the follow-up or supplementary regulations, but shall not be in conflict with higher provisions, shall not be less than the higher standards

8、 required. 25th: units of the company should establish a sound system to ensure safety of the procedure, as follows: (a) according to the regulation, issued by the superior system, technical measures against accidents and equipment manufacturer's manual, operation procedures for enterprises of v

9、arious kinds of equipment, systems, approved by the Chief Executive; (B) issued under the parent's maintenance procedures and regulations, development of enterprise maintenance management systems; according to the canonical description technical regulations and equipment manufacturing, productio

10、n of primary and secondary equipment maintenance procedures and quality standards, by the General Engineering .、Measures to prevent accidents when you need to modify the procedures of the enterprise, should be to supplement or to amend the relevant provisions of regulations, written notice to the pe

11、rsons concerned; (B) procedures should be carried out once a year to review, revise, and notify the person in writing; does not need to be revised, should also issue a review and the signature of the individual "can continue their" written notice concerned personnel; (C) field procedures o

12、nce every 3-5 years a comprehensive二叉排序树的根本操作的实现revision, approved and issued. Field practice for additions or changes, should strictly carry out the approval process. 27th: the Corporation's regular publication list of point system in force; Enterprise published annually a list of the unit'

13、s current point system, and complete list of all procedures relating to the systems. 28th: companies working in other organizations, individuals must be executed in strict two votes (and operational), three systems (shift system, mobile inspection system, regular rotation of test equipment) and the

14、equipment defect management system; operation must strictly implement the system of safe construction and safe technology to give the low-down. If necessary, strictly implement the eight jobs, votes to ban homework. 29th: the operation records shall not be less than 12 months, the remaining long-ter

15、m preservation archives (not less than 8 years). Sixth joint anti-accident measures planned and security technology protection measures article 30th: carbon company must prepare annual accidents per year action plan technical protection measures and security schemes. 31st: carbon annual anti-acciden

16、t measures planned to voice security technology protection measures planned by the company's leading organization, production and technical departments, safety supervision departments participate in the development.Article 32nd anti-accident measures plan should be based on national and superior

17、s issued accident prevention measures, need to address significant deficiencies, and improve equipment reliability improvement measures as well as the accident prevention measures of the unit system. Anti-accident measures plan should be included in the maintenance or reconstruction plans, special e

18、xpenses and establish account for security costs. Article 33rd: security technology protection measures should be based on country, industry, standards issued by the group in order to "scientific development, people-oriented" as the starting point, reduce employee stress, improve working c

19、onditions and prevent personal injury accidents, prevention of occupational diseases, promoting the standardization of safety facilities, improve the level of fire protection and other aspects of the preparation. Project safe construction measures of construction should be in accordance with the spe

20、cific circumstances of the project, operation methods, construction machines, industrial hygiene, the environment and other aspects of the preparation. Article 34th: safety, security, risk analysis, supervision, management, reliability analysis, the result should be the formulation of anti-accident

21、measures planned an important basis of technical protection measures and security schemes. Emergency plan for flood, earthquake, Typhoon and other required items, can be used as a basis for designing and updating of anti-accident measures plan. 35th: carbon companies should prioritize anti-accident

22、measures planned, security technology protection measures required funds. Security technology protection measures required funds extracted from security costs each year, special use. Article 36th: safety supervision Department is responsible for the supervision of anti-accident一 设计要求1. 问题描述 从磁盘读入一组数

23、据，建立二叉排序树并对其进行查找、遍历、插入、删除等根本操作。2. 需求分析建立二叉排序树并对其进行查找，包括成功和不成功两种情况。二 概要设计为了实现需求分析中的功能，可以从以下3方面着手设计。1. 主界面设计为了方便对二叉排序树的根本操作，设计一个包含多个菜单项选择项的主控制子程序以实现二叉排序树的各项功能。本系统的主控制菜单运行界面如图1所示。图1二叉排序树的根本操作的主菜单2. 存储结构的设计本程序主要采二叉树结构类型来表示二叉排序树。其中二叉树节点由1个表示关键字的分量组成，还有指向该左孩子和右孩子的指针。3. 系统功能设计本程序设置了5个子功能菜单，其设计如下。1) 建立二叉排序树

24、。根据系统提示，输入节点的关键字，并以0作为结束的标识符。该功能由Bstree Create()函数实现。2) 插入二叉排序新的节点信息。每次只能够插入一个节点信息，如果该节点已经存在，那么不插入。该功能由Bstree Insert(y)函数实现。3) 查询二叉排序树的信息。每次进行查询，成功那么显示“查询到该节点，不成功那么“显示查询不到该节点“该功能由Bstree Search()函数实现。4) 删除二叉排序树的节点信息。可以对二叉排序树中不需要的节点进行删除，删除的方式是输入关键字，查询到该节点后删除。该功能由Bstree Delete()函数实现。 5) 遍历二叉排序树。遍历二叉排序树

25、可以显示该二叉排序树的全部节点信息。该功能由void Traverse()实现。三 模块设计1. 模块设计本程序包含两个模块：主程序模块和二叉排序树操作模块。其调用关系如图2主程序模块二叉排序树操作模块 图2模块调用示意图2. 系统子程序及其功能设计本系统共设计了5个子程序，个程序的的函数名及其功能说明如下：1) Bstree Create(); /创立二叉排序树2) Bstree Insert(Bstree tree,int key); /插入3) Bstree Search(Bstree tree,int key); /查找4) void Traverse(Bstree tree); /遍

26、历5) Bstree Delete(Bstree tree,int key); /删除信息3. 函数主要的调用关系图本系统9个子程序见的主要调用关系图3.Main()Main()Insert()Search( )Traverse ()Delete ()四 详细设计1. 数据类型定义本系统采用二叉树结构存储节点信息，节点定义如下： typedef struct Bstnodeint key;struct Bstnode *lchild,*rchild;Bstnode,* Bstree;2. 主要子程序的详细设计1) 二叉排序树的创立函数，主要用来建立二叉排序树。 Bstree Create()

27、int key;Bstree tree=NULL; /初始化空树scanf("%d",&key); while(key!=0)tree=Insert(tree,key); /逐个插入节点scanf("%d",&key);return tree;2) 二叉排序插入函数如下： Bstree Insert(Bstree tree,int key)Bstree p=tree;Bstree s,f;while (p!=NULL)f=p; if(key=p->key) return tree; if(key<p->key) p=p-

28、>lchild; else p=p->rchild;s=(Bstree)malloc(sizeof(Bstnode);s->key=key;s->lchild=NULL;s->rchild=NULL;if(tree=NULL) return s; /新节点为二叉排序树的根if(key<f->key) f->lchild=s; else f->rchild=s; return tree; 3) 二叉排序树查询函数如下： Bstree Search(Bstree tree,int key)Bstree p=tree; int flag=0; w

29、hile(p!=NULL) if(p->key=key) printf("查询到该节点！");flag=1;return(p);break;if (key<p->key) p=p->lchild; else p=p->rchild; if(flag=0)printf("查询不到关键字为%d的节点！",key);return NULL; 五 测试分析1. 二叉排序树的建立首先进入主菜单，如图1。在主菜单下，用户根据菜单的选项输入1，然后按照提示建立二叉排序树，并以0未结束符。运行的结果如图4. 图4二叉排序树的建立2. 遍历二

30、叉树的节点信息在主菜单下，用户选择4，可以打印出全部的节点信息。运行的结果如图5. 图5遍历二叉排序树3. 插入节点信息信息在主菜单下，用户选择2，可以插入一个新的节点信息。运行的结果如图6.图6插入新的节点4. 查询二叉树的节点信息在主菜单下，用户选择3，首先通过输入关键字查询相关信息。运行的结果如图7. 图7查询节点信息5. 删除二叉树的节点在主菜单下，用户选择5，可以通过输入要删除的关键字来删除该节点的全部信息。运行的结果如图8. 图8删除二叉排序树的节点 在主菜单下，用户输入6并回车，即退出“二叉树根本操作程序。六 原程序清单#include<stdio.h>#includ

31、e<stdlib.h>#include<malloc.h>/*二叉排序树的数据结构*/typedef struct Bstnodeint key;struct Bstnode *lchild,*rchild;Bstnode,* Bstree;Bstree Create(); /创立二叉排序树Bstree Insert(Bstree tree,int key); /插入Bstree Search(Bstree tree,int key); /查找void Traverse(Bstree tree); /遍历Bstree Delete(Bstree tree,int key

32、); /删除/*创立二叉排序树*/Bstree Create() int key;Bstree tree=NULL; /初始化空树scanf("%d",&key); while(key!=0)tree=Insert(tree,key); /逐个插入节点scanf("%d",&key);return tree;/*插入*/ Bstree Insert(Bstree tree,int key)Bstree p=tree;Bstree s,f;while (p!=NULL)f=p; if(key=p->key) return tree;

33、if(key<p->key) p=p->lchild; else p=p->rchild;s=(Bstree)malloc(sizeof(Bstnode);s->key=key;s->lchild=NULL;s->rchild=NULL;if(tree=NULL) return s; /新节点为二叉排序树的根if(key<f->key) f->lchild=s; else f->rchild=s; return tree;/*查找*/Bstree Search(Bstree tree,int key)Bstree p=tree;

34、 int flag=0; while(p!=NULL) if(p->key=key) printf("查询到该节点！");flag=1;return(p);break;if (key<p->key) p=p->lchild; else p=p->rchild; if(flag=0)printf("查询不到关键字为%d的节点！",key);return NULL; /*遍历*/void Traverse(Bstree tree)if(tree) Traverse(tree->lchild); printf("%

35、4d",tree->key); Traverse(tree->rchild); /*删除*/Bstree Delete(Bstree tree,int key)Bstree p=tree; Bstree f,s,q; f=NULL;while(p) /查找关键字为key的节点if(p->key=key) break; f=p; if(p->key>key) p=p->lchild;else p=p->rchild;if (p=NULL) return tree; if (p->lchild=NULL)|(p->rchild=NUL

36、L) if(f=NULL) if(p->lchild=NULL) tree=p->rchild;else tree=p->lchild;else if (p->lchild=NULL) if(f->lchild=p) f->lchild=p->rchild; else f->rchild=p->rchild; else if(f->lchild=p) f->lchild=p->lchild; else f->lchild=p->lchild; free(p);else q=p;s=p->lchild; while(s->rchild)q=s;s=s->rchild; if(q=p) q->lchild=s->lchild;p->key=s->key; free(s);return tree;/*/void main() system("color 1E");Bstree tree,p;int key1,key2,key3;int select,flag;printf("#n");printf("|