摘要
阐述了二叉树前驱全线索化的构造策略和算法,详细地介绍了在全线索化基础上所形成的二叉权线索迂回链表,给出了后继和前驱全线索之间的转换算法,并分析了线索迂回链表的益处。
This paper expounds the principle and methods of the precursory all thread of binary tree.It also introduces in detail the thread-round-links made on the basis of all threading, and gives the algorithms of the exchange between succedent all thread and precursory all thread. Furthermore,it analyses some of the advantages of the thread-round-links.
出处
《北京工业大学学报》
CAS
CSCD
1996年第2期105-110,共6页
Journal of Beijing University of Technology
关键词
线索迂回链
二叉树
计算机
数据结构
thread-round-links, binary tree, precursory all thread