摘要
提出了一种适用于有序树的存贮与恢复的算法。具有简洁明了、实现效率高、占用存储空间小等特点。
A kind of algorithm for saving and loading of ordered tree is offered. Comparing with other algorithms, it has the following characteristics such as simple and short, highly efficiency and small me moryrequirments,etc.
出处
《电脑与信息技术》
2000年第4期10-13,共4页
Computer and Information Technology
关键词
数据结构
有序树
先根顺序存贮算法
ordered tree
depth
prio root-order saving method
father-child-elder-young erexpression
