摘要
采用静态数组的方式给出树的一种存储结构 ,并给出这种存储结构下的几种常用运算的 C语言程序 .这种存储结构避开了链式存储结构中链域个数不定的困难 ,容易用 Fox BASE等关系型数据库来实现相应的运算 。
This paper obtained a kind of storage structure of tree by using static arrays,and has given out some algorithm based on this storage structure by C language.This storage structure avoids the difficulty that the number of linked range in linked list is indefinite,and it is easy to realiz the algorithm under relationship databases such as.FoxBASE,also this storage structure can use unity method to deal with binary tree and tree.
出处
《湖南大学学报(自然科学版)》
EI
CAS
CSCD
2000年第1期109-112,共4页
Journal of Hunan University:Natural Sciences
基金
国家自然科学基金资助项目! ( 6 9973 0 16 )