基于完全二叉树概念的算法设计与分析  

Based on completely two forks trees concept algorithm design and analysis

作　　者：李爱华[1] 刘晓红[1] 张衍杰[1] 

机构地区：[1]山东理工大学计算机科学与技术学院,山东淄博255049

出　　处：《山东理工大学学报（自然科学版）》2006年第3期56-58,共3页Journal of Shandong University of Technology:Natural Science Edition

摘　　要：树型结构是一类非常重要的非线性结构,特别是完全二叉树结构本身的特点,在程序设计中有着广泛的应用.本文主要实现了二叉树的图形处理算法、无序表顺序查找改进算法及非递归建立二叉树算法等,并对算法进行了分析.The tree structure is a kind of extremely important non-linear structure, specially completely two forks trees structure itself characteristic, has the widespread application in the programming. This article mainly implements following algorithms： two forks tree＇s graph processing algorithm, unordered list sequence search improved algorithm, the non-recursion established two forks tree and so on, and carries on the analysis to its algorithm.

关 键 词：完全二叉树 递归技术 指针 时间复杂度 平均查找长度 

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