事故二叉树计算机算法

【摘　要】　根据《数据结构》中的二叉树算法,结合事故树算法的特点,提出事故二叉树算法。该算法是对事故树求解算法的有益补充和发展，具有广阔的应用前景和现实意义。
【关键词】　事故树　二叉树　二叉树遍历　事故二叉树　二叉树结点分裂法

Yu Xiangqian　Cai Sijing
(School of Resources Engineering, the University of Science & Technology Beijing)

Abstract　On the basis of the algorithm of binary tree in DATA STRUCTURES and the algorithm of fault tree, the algorithm of fault binary tree is put forward. It's an useful compliment and step forawrd of the algorithm of fault tree. It opens up a vast range of application prospects and has practcal significance.
Key words：　Binary tree　Fault tree　Traversing binary tree　Fault binary tree
Algorithm of splitting the node of binary tree

图1　事故树举例

struct node {
　　struct node *fch;
　　double hori;
　　int vert;
　　char *info;
　　int gate,chinum;
　　struct node *pare,*nsib;
　　……(还可以继续扩充)
　　}；
　　对应图1的事故二叉树的存储结构表示如图2。