Note that this practice problem is to be turned in like a project. I'll count it like a "hold up your homework" problem from A-quad.
Do Ex 5.14, pg 390 in the book, a problem about converting from AVL trees to red-black trees. This will take a bit of thinking, but the code to a correction solution isn't very long. My solution was about 12 lines of code.
Find the starter code at
/homes/tvandrun/Public/cs345/treesAVLRB-given
Turn in your solution (file AVLToRB.java)
to /cslab/class/cs345/(your id)/treesAVLRB.
Due Wed, March 25, 5:00pm. A solution can be found at
/homes/tvandrun/Public/cs345/treesAVLRB-soln
...but permissions are set so that you can't read it until after it's due.