logo Practice-It logo

BJP3 Self-Check 17.6: traversal3

Language/Type: Java binary trees tree traversals
Author: Robert Baxter (on 2013/04/01)

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.