二叉树的线索迂回链表

朱上俭. 二叉树的线索迂回链表[J]. 北京工业大学学报, 1996, 22(2): 105-110.

引用本文:

朱上俭. 二叉树的线索迂回链表[J]. 北京工业大学学报, 1996, 22(2): 105-110.

Zhu Shangjian. The Thread-Round-links of Binary Tree[J]. Journal of Beijing University of Technology, 1996, 22(2): 105-110.

Citation:

Zhu Shangjian. The Thread-Round-links of Binary Tree[J]. Journal of Beijing University of Technology, 1996, 22(2): 105-110.

The Thread-Round-links of Binary Tree

摘要: 阐述了二叉树前驱全线索化的构造策略和算法,详细地介绍了在全线索化基础上所形成的二叉权线索迂回链表,给出了后继和前驱全线索之间的转换算法,并分析了线索迂回链表的益处.

Abstract: 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.

/