一种全线索化的线索二叉树

A new threaded binary-tree

线索二叉树是数据结构中的一项重要内容，提出了对二叉树加线索时的一种新方法．比较的结果表明，新算法所生成的线索二叉树比传统的先序和后序线索二叉树优越，它使得在对线索二叉树进行先序遍历和后序遍历时，如同对线性链表一样简单．

The problem of threaded binary-tree is an important part of data structures. This paper presents a new method for threaded binary-tree. The comparied results show 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 binary- tree as easy as linear list.