Levels Tought:
Elementary,Middle School,High School,College,University,PHD
Teaching Since: | Apr 2017 |
Last Sign in: | 10 Weeks Ago, 4 Days Ago |
Questions Answered: | 4870 |
Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
Problem statement: For a binary tree, one of the traverse result is given as an input, your algorithm should create corresponding two other traverse results. For example if inorder traverse is given, the pre-order and post-order should be created.Your report should include: a) pseudocode for your method, b)the program with comments, c) Big-O analysis, d) your program’s outputs for the following exact three inputs, in the same order:
1) Pre-order: 1,2,3,4,5,6,7,8,9,10,11,12
Post-order: ???
In-order: ???
2) In-order: 1,2,3,4,5,6,7,8,9,10,11,12
Pre-order: ???
Post-order: ???
3) Post-order: 1,2,3,4,5,6,7,8,9,10,11,12
Pre-order: ???
In-order: ???
-----------