logo Practice-It logo

BJP3 Exercise 17.18: inOrderList

Related Links:
Author: Robert Baxter (on 2013/04/01)

Write a method inOrderList that could be added to the IntTree class. The method returns a list containing the sequence of values obtained from an in-order traversal of your binary tree of integers. For example, if a variable tree refers to the following tree:

              | 7 |
             /     \
         +---+     +---+
         | 4 |     | 2 |
         +---+     +---+
        /         /     \
    +---+     +---+     +---+
    | 9 |     | 5 |     | 0 |
    +---+     +---+     +---+

Then the call tree.inOrderList() should return the following list:

[9, 4, 7, 5, 2, 0]

If the tree is empty, your method should return an empty list.

You may define private helper methods to solve this problem, but otherwise you may not call any other methods of the class nor create any data structures such as arrays, etc. other than the list you will eventually return. Your method should not change the structure or contents of the tree.

Assume that you are adding this method to the IntTree class as defined below:

public class IntTree {
    private IntTreeNode overallRoot;
Type your solution here:

This is a partial class problem. Submit code that will become part of an existing Java class as described. You do not need to write the complete class, just the portion described in the problem.

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.