Reconstruction of A Binary Search Tree from Its Preorder Tree Traversal With The Unique Non-Recursive Approach

This paper presents a new approach of reconstruction of Binary search tree using its Pre order tree-traversal only. There are many approaches given with the help of combination of two- tree traversals. But, in this paper we have not used any other combination of tree traversals to reconstruct the Binary search tree. Our work shows the implementation of this algorithm in C language. Our algorithm is 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.