logo CodeStepByStep logo

bstAdd1

Language/Type: C++ binary trees tree traversals
Author: Marty Stepp (on 2016/08/27)

Suppose that the following elements are added in the specified order to an empty binary search tree:

  • Dodo, Eaglet, Rabbit, Cat, Alice, Jabberwock, Hatter, Tweedledee, Queen, Bill

Write the elements of the tree above in the order they would be seen by a pre-order, in-order, and post-order traversal. Type your solutions with the elements separated by spaces and/or commas, such as:

One, Two, Three, Four
pre-order
in-order
post-order

You must log in before you can solve this problem.


Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.