摘要
本文提出了三叉树的全线索化,论证了构造策略和方法,描述了实现过程。给出了对这种全线索二叉树所进行的主要运算的算法。本文还较详细地介绍了在全线索化基础上所形成的二叉树的线索迂回链,从而真正实现了非线性结构的线性化,并分析了它所带来的益处。
This paper deals with all thread of binary tree. It proves the principle and methods of the struc- ture, describes the process of realization, and gives the algorithms of principal calculating the all threaded binary tree. This paper also introduces in detail to thread-round-links which are made after all threading, it is realized really to transform form nonlinear structure into linear structure. Einary,it proves that the linearization have an advantage.
关键词
二叉树
全线索化
数据结构
Binary tree
All threaded
Thread-round-links
