logo Practice-It logo

Main Page → Problems → Solve a Problem

BinaryTreeTraversal2

Language/Type: Java binary trees tree traversals
Author: Stuart Reges (on 2021/04/02)

Consider the following tree. 

                                 +---+
                                 | 2 |
                                 +---+
                               /       \
                             /           \
                       +---+               +---+
                       | 0 |               | 3 |
                       +---+               +---+
                      /     \                   \
                     /       \                   \
                  +---+     +---+               +---+
                  | 5 |     | 7 |               | 4 |
                  +---+     +---+               +---+
                 /               \             /     \
                /                 \           /       \
             +---+               +---+     +---+     +---+
             | 1 |               | 6 |     | 9 |     | 8 |
             +---+               +---+     +---+     +---+

Fill in each of the traversals below:

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.