Construction of a tree from a given single order traversal and also find the other order traversal of a tree
DOI:
https://doi.org/10.26438/ijcse/v6si5.115118Keywords:
Preorder to Postorder, Postorder to Preorder, Preorder to Inorder, One order traversalAbstract
As we know that tree traversal means to visit every node of a tree exactly once [1]. We can traverse a tree in three way these are Inorder, Preorder and Postorder. We can easily construct a tree from given two order these order can be Inorder and Preorder, Inorder and Postorder etc. Here we will be construct the tree from given one order and after constructing the tree we will find the other order traversal of a tree
References
[1] M. R. Headington, D. D. Riley, “Data Abstraction and Structures using C++”, Jones and Bartlett Publishers,London, pp. 621-624,1997, ISBN no 0-7637-0295-1.
[2] A. M. Berman, “Data Structures via C++ objects by Evaluation”, Oxford University Press,New York, pp.326,1997, ISBN no 0-19-510843-4.
[3] N.Dale, D. T. Joyce, C. Weems , “Object-Oriented Data structures using Java” ,Narosa Publishing House,New Delhi, pp.536,2002, ISBN no 81-7319-551-X.
[4] A. Drozdek, “Data Structures and Algorithms in C++”,Brooks /Cole Thomson learning, Vikas Publishing House, Singapore,pp.226-234, 2001, ISBN no 981-240-079-6.
Downloads
Published
How to Cite
Issue
Section
License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
