| 基于完全二叉树概念的算法设计与分析 |
| |
| 引用本文： | 李爱华,刘晓红,张衍杰.基于完全二叉树概念的算法设计与分析[J].山东理工大学学报,2006,20(3):56-58. |
| |
| 作者姓名： | 李爱华 刘晓红 张衍杰 |
| |
| 作者单位： | 山东理工大学计算机科学与技术学院 山东淄博255049 |
| |
| 摘 要： | 树型结构是一类非常重要的非线性结构,特别是完全二叉树结构本身的特点,在程序设计中有着广泛的应用.本文主要实现了二叉树的图形处理算法、无序表顺序查找改进算法及非递归建立二叉树算法等,并对算法进行了分析.
|
| 关 键 词： | 完全二叉树 递归技术 指针 时间复杂度 平均查找长度 |
| 文章编号： | 1672-6197(2006)03-0056-03 |
| 收稿时间： | 11 9 2005 12:00AM |
| 修稿时间： | 2005年11月9日 |
Based on completely two forks trees concept algorithm design and analysis |
| |
| LI Ai-hua,LIU Xiao-hong,ZHANG Yan-jie.Based on completely two forks trees concept algorithm design and analysis[J].Journal of Shandong University of Technology:Science and Technology,2006,20(3):56-58. |
| |
| Authors: | LI Ai-hua LIU Xiao-hong ZHANG Yan-jie |
| |
| Institution: | School of Computer Science and Technology, Shandong University of Technology, Zibo 255049, China |
| |
| Abstract: | 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. |
| |
| Keywords: | completely two forks trees recursion technology indicator time order of complexity average search length |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
