First, I finished the section on rootish array stacks. I then continued to chapter 3 on linked lists, specifically singly linked lists.
From the list of exercises:
Write pseudocode solving Exercise 3..2, that is write pseudocode for a second_last method on SSList. Give the running time in big-O notation of your pseudocode.
Write pseudocode solving Exercise 3..3, that is write pseudocode for get, set, add, and remove. Again, give the running time in big-O notation for each method.
Write pseudocode solving Exercise 3..4, that is write pseudocode for the reverse method. Again, give the running time in big-O notation for this method.
Once I discuss the implementation in a future lecture, we will come back to these three exercises and implement them in C++.