参考文献/References:
[1] Knuth D E.The art of computerprogramming volume 1:fundamental algorithms [M].3rd Edition.New York:Addison Wesley,1997.
[2] Mu S C,Bird R S.Rebuilding a tree from its traversals:a case study of program inversion [EB/OL].
[2012-10-11].http:∥citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.1166.
[3] Burgdorff H A,Jojodia S,Springsteel F N,et al.Alternative methods for the reconstruction of tree from their traversals [J].BIT,1987,27(2):134-140.
[4] Gen-Huey Chen,Yu M S,Liu L T.Two algorithms for constructing a binary tree From its traversals [J].Information Processing Letters,1988,28(6):297-299.
[5] Andersson A,Carlsson S.Construction of a tree from its traversals in optimal time and space [J].Information Processing Letters,1990,34(1):21-25.
[6] Mäkinen E.Constructing a binary tree efficiently from its traversals [J].International Journal of Computer Mathematics,2000(1):75.
[7] 唐自立.基于遍历序列的唯一确定树或二叉树的方法 [J].小型微型计算机系统,2001,22(8):985-988.
[8] 唐自立.基于遍历序列的构造严格二叉树的算法 [J].苏州大学学报:自然科学版,2010,26(3):40-43.
[9] Arora N,Tamta V K,Kumar S.Modified non-recursive algorithm for reconstructing a binary tree [J].International Journal of Computer Applications,2012,43(10):25-28.
[10] 化志章,揭安全,杨庆红.树非递归遍历统一的新解法及其形式证明 [J].江西师范大学学报:自然科学版,2010,34(2):123-127.
[11] Gries D.The science of programming [M].New York:Springer-Verlag,1981.
[12] Dijkstra E W,Scholten C S.Predicate calculus and program semantics [M].New York:Springer-Verlag,1990.