二叉树演绎于结点序号内蕴性质快速算法.pdfVIP

16 2011 ，47 （9） Computer Engineering and Applications 计算机工程与应用 二叉树演绎于结点序号内蕴性质的快速算法 王兴波 WANG Xingbo 佛山大学 机电与信息工程学院，广东 佛山 528000 College of Mechatronics and Information Engineering ，Foshan University ，Foshan ，Guangdong 528000 ，China WANG Xingbo.Fast algorithms educed from intrinsic properties of node indices of binary trees.Computer Engineering and Applications ，2011 ，47 （9 ）：16-20. Abstract ：Through a study on properties of node-indices of a binary tree ，the paper derives for processing binary trees sever- al new non-recursive and stack-free algorithms ，including an algorithm to query the Lowest Common Ancestor （LCA ）of two nodes in a complete binary tree ，an algorithm for fast inorder traverse ，an algorithm for inter-conversions between the sequen- tial sequence and the inorder sequence ，and an algorithm to restore a complete binary tree from its sequential sequence or in- order sequence.All the new algorithms are of excellent time-complexity and spatial complexity.In aspect of time-complexity ， the new LCA-query algorithm can answer without any preprocessing a query of LCA of two nodes in a complete binary tree in constant time and the other new algorithms are linear time complexity.In aspect of spatial complexity ，all the new al- gorithms are constant spatial complexity.Furthermore ，all new algorithms contain merely addition ，subtraction and bitwise opera- tions and thus fit both conventional programming and expert developments such as embedded system and so on. Key words ：algorithm design ；binary tree ；inorder traversal ；fast query 摘 要：通过研究二叉树结点顺序存储序号的性质，演绎出了二叉树非递归无堆栈的一些新算法，包括完全二叉树两结点最近共 同祖先（LCA ）的查询算法、中序遍历算法、顺序序列与中序序列的互转算法以及从中序序列恢复层次结构的算法。新的算法都 具有很好的时间复杂度，其中LCA 查询算法可在常数时间内实现且不需要任何预处理过程，其他算法均为线性时间复杂度。所 有算法均为常数空间复杂度，仅涉及到简单的加减运算与位运算，既可用于常规程序设计也可用于嵌入式等专业开发。 关键词：算法设计；二叉树；中序遍历；快速访问 DOI ：10.3778/j.issn. 1002-8331.2011.09.005 文章编号：1002-8331（2011）09-0016-05 文献