一种完全基于高度的满二叉树判定算法  

A Deciding Algorithm of Full Binary Tree Completely Based on Height

作　　者：张利群[1] 张杰[1] 

机构地区：[1]辽宁石油化工大学职业技术学院,辽宁抚顺113001

出　　处：《辽宁石油化工大学学报》2009年第2期60-62,共3页Journal of Liaoning Petrochemical University

摘　　要：分析了满二叉树具有的性质,得到了满二叉树的一个等价定义,利用该等价定义给出了一种完全基于高度的满二叉树判定算法。该算法解决了传统上既要计算二叉树高度又要计算二叉树中结点个数来判定一棵二叉树是否为满二叉树的问题,丰富了满二叉树的判定方法。应用结果表明,这种完全基于高度的满二叉树判定算法运行正确,判定结论可信。By analyzing the characteristic of full binary tree, an equivalence definition was obtained. A decision algorithm of full binary tree completely based on height was provided by the equivalence definition. The algorithm solved the traditional deciding problem of full binary tree. The traditional method needs not only calculate binary tree height but also count branch node numbers. The new decision algorithm enriched the deciding methods of full binary tree. The application shows that the decision algorithm of full binary tree completely based on height runs accurately and the decision result is creditable.

关 键 词：满二叉树 算法 递归 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]