Assessment 8: Recursion

This assessment will measure your ability to:

This assessment is designed to be completed in fifty minutes or less.

You'll be modifying your implementation of Project 4 in order to get them to work with the UnitTests.javawith this assessment.

You'll need to do the following for this assessment:

In this assessment, you'll modify your TreeNode implementation to implement a recursive method called public boolean sorted(). It will decide whether the ids of the nodes beneath the current node are in sorted order with respect to the parent node. You may use the natural sorted ordering of strings.

Submission Instructions

Upload all of your project files to Marmoset using the link to assessment8_sample. Make sure you click the correct link, as there are ten versions of this assessment, and your answers will only work for one of them.

See the instructions below to walk you through how to upload a file to Marmoset.

[Marmoset upload help] (opens in new window)