Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

Main Page → Problems → Solve a Problem

traversal3

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

Write the elements of the tree below in the order they would be seen by a pre-order, in-order, and post-order traversal. 

          +---+
          | 2 |
          +---+
               \
               +---+
               | 1 |
               +---+
              /     \
          +---+     +---+
          | 7 |     | 6 |
          +---+     +---+
         /               \
     +---+               +---+
     | 4 |               | 9 |
     +---+               +---+
    /     \             /
+---+     +---+     +---+
| 3 |     | 5 |     | 8 |
+---+     +---+     +---+
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.