| 支持可重构计算的满二叉树中序存储策略及快速遍历算法 |
| |
| 引用本文： | 王兴波.支持可重构计算的满二叉树中序存储策略及快速遍历算法[J].佛山科学技术学院学报(自然科学版),2011,29(1):47-52. |
| |
| 作者姓名： | 王兴波 |
| |
| 作者单位： | 佛山科学技术学院,机电工程系,广东,佛山,528000 |
| |
| 基金项目： | 广东省自然科学基金资助项目 |
| |
| 摘 要： | 通过对满二叉树顺序存储序列与中序序列之间解析关系的研究,推导与证明了完全二叉树的一些重要性质,给出了一种可快速访问的满二叉树中序序列存储方法并设计出相应的遍历算法。基于该方法,一颗具有N个结点的满二叉树中序序列仅需要线性时间复杂度O(N)即可遍历,相关计算过程可嵌入在可重构系统中形成可重构计算单元。还给出了算法的C++实现过程及可重构系统的设计方案。
|
| 关 键 词： | 可重构计算 满二叉树 中序序列 快速访问 |
Storage strategy and rapid in-order traversal algorithm available for reconfigurable computation of full binary trees |
| |
| WANG Xing-bo.Storage strategy and rapid in-order traversal algorithm available for reconfigurable computation of full binary trees[J].Journal of Foshan University(Natural Science Edition),2011,29(1):47-52. |
| |
| Authors: | WANG Xing-bo |
| |
| Institution: | WANG Xing-bo (Department of Mechatronics Engineering,Foshan University,Foshan 528000,China) |
| |
| Abstract: | This paper makes a study on the analytic relationship between the sequential storage and the in-order sequence of a full binary tree,deducts and proves some important properties of a full binary tree,and puts forward a storage strategy and an algorithm that can rapidly store and traverse the inorder sequence of the full binary tree.The method reaches a linear time complexity O(N) for traversing an in-order sequence of a full binary tree with N nodes and its computing procedure can be embedded into a reconfi... |
| |
| Keywords: | reconfigurable computation full binary tree in-order sequence rapid traversal |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
