Last week, we saw how to implement lists using differnt underlying representations. In recitation this week, you will practice interacting/modifying the underlying representations as you add new features to the two implementations from last week. Additionally, in preparation for trees, you will practice working with and manipulating linked lists.
Implement the operations described below for both the AList and the LList.
equals
method for the ADT list that returns true when the entries in one list equal the entries in a second list.Implement the operations described below for the LList. If you want to, you may also do so for the AList.
This is for your practice. You should be able to complete some of the functions by the end of recitation. If you complete a function, call the TA over to look over your function to make sure it is correct. If you do not have time to complete the programs before the end of recitation, you have the option of uploading it to CourseWeb once you are finished to receive feedback on it from the TA. If you upload it after Monday, November 16, please email the TA so he knows to look at it.