期刊名称：Oriental Journal of Computer Science and Technology
印刷版ISSN：0974-6471
出版年度：2011
卷号：4
期号：1
页码：217-219
出版社：Oriental Scientific Publishing Company
摘要：This paper presents a new approach of reconstruction of Binary search tree using its Preorder tree-traversal only. There are many approaches given with the help of combination of two- treetraversals. But, in this paper we have not used any other combination of tree traversals to reconstructthe Binary search tree. Our work shows the implementation of this algorithm in C language. Our algorithmis found to be very simple and faster than other non recursive algorithms due to its unique implementation.Due to this reason the time and space complexities are significantly reduced
关键词：Binary Search Tree Reconstruction; Non Recursive Algorithm;Pre order Traversal; Binary Search Tree; Struct
