Open Access   Article Go Back

Construction of a tree from a given single order traversal and also find the other order traversal of a tree

Vaibhav Sharma1

Section:Research Paper, Product Type: Journal Paper
Volume-06 , Issue-05 , Page no. 115-118, Jun-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6si5.115118

Online published on Jun 30, 2018

Copyright © Vaibhav Sharma . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Vaibhav Sharma, “Construction of a tree from a given single order traversal and also find the other order traversal of a tree,” International Journal of Computer Sciences and Engineering, Vol.06, Issue.05, pp.115-118, 2018.

MLA Style Citation: Vaibhav Sharma "Construction of a tree from a given single order traversal and also find the other order traversal of a tree." International Journal of Computer Sciences and Engineering 06.05 (2018): 115-118.

APA Style Citation: Vaibhav Sharma, (2018). Construction of a tree from a given single order traversal and also find the other order traversal of a tree. International Journal of Computer Sciences and Engineering, 06(05), 115-118.

BibTex Style Citation:
@article{Sharma_2018,
author = {Vaibhav Sharma},
title = {Construction of a tree from a given single order traversal and also find the other order traversal of a tree},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {6 2018},
volume = {06},
Issue = {05},
month = {6},
year = {2018},
issn = {2347-2693},
pages = {115-118},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=433},
doi = {https://doi.org/10.26438/ijcse/v6i5.115118}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i5.115118}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=433
TI - Construction of a tree from a given single order traversal and also find the other order traversal of a tree
T2 - International Journal of Computer Sciences and Engineering
AU - Vaibhav Sharma
PY - 2018
DA - 2018/06/30
PB - IJCSE, Indore, INDIA
SP - 115-118
IS - 05
VL - 06
SN - 2347-2693
ER -

           

Abstract

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.

Key-Words / Index Term

Preorder to Postorder, Inorder to Preorder,Postorder to Preorder, Preorder to Inorder, One order traversal

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.