摘要
本文首次提出一种新型线索二叉树及相应遍历新算法，证明了它们的某种最佳性．
A new-type of threaded binary tree and its traversal algorithm are proposed in this paper.It is proved that they have some optimality.
出处
《计算机学报》
EI
CSCD
北大核心
1994年第3期232-235,共4页
Chinese Journal of Computers
关键词
数据结构
线索二叉树
Data structures
threaded binary tree
traversal algorithm
algorithm complexity
