You may work with another person on this, but you must be in the same room with them when you work on it and you should follow pair programming practices when writing code.
Read through the assignment in its entirety. The longest part is at the very end; it requires you do a fair amount of programming. Some other questions look long, but this is because I'm providing what I hope is helpful information.
Turn in assignment as both a hardcopy in class (you do not need to print out all the separate webpages for part D in this assignment, however, please indicate the link to the resulting webpages somewhere in your assignment writeup) and a zipped file, using this link to cardea. Please have all your code as runnable .java files.
Show the output of running this on examples.
(2) Optional Bonus Question Write a method boolean isPalindrome(String s) that returns whether the string s is a palindrome or not. Remember that a palindrome is a string that reads the same forwards as backwards, for example noon, racecar, madam. For simplicity, you may assume the string s has the same capitalization throughout and no spaces or punctuation. Show the output of running this on examples.
To help you with this question, here is advice on how to write recursive functions:
if ( error condition ) return (error value); if( base case 1) return (terminal value 1); . . . if( base case x) return (terminal value x); make recursive call(s) (closer to some base case) operate on returned value(s) as necessary return answer
To help you visualize this, see this sample output from Kaichi's implementation on ski resort data.
You probably need to modify the FullTree code to include an attribute for storing a hyperlink. You can modify it directly or use the Java subclass mechanism to extend the FullTree class.
You need to start with some data for generating a hierarchy. You may use real category labels from an existing hierarchy to illustrate the results, or make up your own hierarchy. Your hierarchy must contain at least 60 nodes and a height of at least 3 (recall that the root is at level 0, so a tree of height 3 has 4 levels). If you like, you can instead use this hierarchy of descriptions of ski resorts provided by Kaichi.
In your assignment writeup, be sure to give us links to the web pages that you generate as a result of running the code.