logo CodeStepByStep logo


Language/Type: C++ binary trees tree traversals

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)

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.