logo Practice-It logo


Language/Type: Java binary search trees tree traversals
Author: Robert Baxter

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

  • Meg, Stewie, Peter, Joe, Lois, Brian, Quagmire, Cleveland

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

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.