【摘要】 数据结构中二叉树有很多的遍历算法,但本质都是将属性结构转换为线性序列,简化问题。在遍历序列中,每个节点都有自己的前驱和后去,但在二叉树遍历过程中寻求答案却因为时间复杂度等因素使操作效率低下。线索二叉树很好地解决了这一问题,本文是在二叉树的基础上加入线索二叉树实现数据的快速可操作性。更多还原

【Abstract】 The binary tree data structure has a lot of traversal algorithm,but the essence is to charg the attribute structure into linear sequence,to simplify question.In the traversal sequence,each node has its own precursor and post-go,but in the process of a binary tree traversal to find the answer is inefficient because of the time complexity and other factors.Binary tree is a good clue to solve this problem.This article has realized fast operation on bisis of the binary tree clues joining binary tree.更多还原