近年来，计算机辅助事故树分析方法发展很快，新的算法不断被提出。本论文根据《数据结构》［1］中的二叉树算法，结合事故树算法的特点，提出事故二叉树算法。通过建立事故二叉树及利用本文所介绍的一系列事故二叉树算法，不仅可以很方便地实现事故树定性分析中的最小割集和最小径集的求解,以及实现事故树定量分析中的顶上事件发生概率、各基本事件的概率重要度和临界重要度的求解，而且可以实现计算机辅助事故树绘图中的坐标计算问题。该算法是对事故树求解算法的有益的补充和发展，具有现实意义和广阔的应用前景。-In recent years, computer-aided fault tree analysis methods have developed rapidly, the new algorithm is constantly being raised. In this paper, under the "Data structure" [1] in the binary tree algorithm, combined with the characteristics of the accident tree algorithm is proposed binary tree algorithm for the accident. Through the establishment of an accident and the use of binary tree described in this article a series of incidents binary tree algorithm, not only can easily achieve the qualitative analysis of fault tree minimal cut sets and path sets the best solution, and the achievement of the quantitative analysis of fault tree top event probability, the probability of basic event importance degree and the critical importance degree of the solution, but also enables computer-aided fault tree drawing, the coordinates of computational problems. The algorithm is a fault tree algorithm useful complement and development of practical significance and broad application prospects.