摘要
二叉树是一种重要的数据结构,而线索二叉树是为了保存在遍历二叉树时得到的信息.提出了一种新的方法对二叉树加线索,重新定义了LTag域和RTag城的使用方法.分析结果表明,新算法所生成的线索二叉树比传统的先序和后序线索二叉树优越,它使得在对线索二又树进行先序遍历和后序遍历时,使其遍历过程更加简单.
The binary-tree is an important data structure. Threaded binary-tree is used for saving the information at traveling through out the binary trees. In this paper, a new method for adding thread of binary tree is presented. The new method is defind for Ltag domain and Rtag domain. The comparied result shows that the threaded binary-trees generated by the new method are more efficient than the traditional ones. The new method makes the preorder and postorder traversal of the threaded binary-tree very easy.
出处
《沈阳理工大学学报》
CAS
2008年第6期18-20,共3页
Journal of Shenyang Ligong University
关键词
线索二叉树
遍历
数据结构
threaded binary-tree
traversal
data structure
