logo CodeStepByStep logo

bstAdd3

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:

  • Leia, Boba, Darth, R2D2, Han, Luke, Chewy, Palpatine, Jabba, Anakin

Which of the following binary search trees would result? Choose the appropriate tree, and also 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.

binary search tree
(order shuffled)
pre-order
in-order
post-order

You must log in before you can solve this problem.


Log In

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.