Since apparently AlgoTutorBot
CAN’T DO THE SIMPLE JOB HE WAS PROGRAMMED FOR is having some trouble, we had to
change today’s lesson a little. Originally, we were going to have you use an AVL Tree to make something really cool.
But now, we’re going to have to fix the broken AVL code instead. Sigh.
The AVL Tree implementation is quite simple, only letting you insert new elements and traverse them in order.
So it’s suprising that AlgoTutorBot couldn’t even achieve this, but I guess you get what you paid for.
When the algorithm works correctly, you should be able to use the algorithm to create a sorted list of values.
This is demonstrated by the unit tests provided alongside the AVL Tree.
Fortunately, the unit tests do not have any bugs (that I know about, anyway).
As far as I can tell, the program is broken in seven places. Each bug is small and shouldn’t require fixing more than a couple lines. You need to track the bugs down, fix them, and then put a comment at each bug location. That comment should explain what you changed and give the name(s) of who found that specific bug.
Work with your group mates to find, fix, and label all the bugs in the program. Then, at the top of your program, write a comment describing how your teammates went about debugging the implementation. Also clearly identify your group members name and emails.
Submit the final version of your program on GradeScope here: https://www.gradescope.com/courses/230699/assignments/1058536/
You do not need to submit your unit tests.
Be sure to clearly identify all of your groupmates in the GradeScope submission.
Sometimes I think AlgoTutorBot was a terrible investment.