Lecture 15

Learning Outcomes

At the end of this lecture, you’ll be able to:

• Explain and trace the core operations of List ADT.
• Describe the difference between similar operations (e.g. front vs. removeFront).
• Describe the role of Position abstraction.
• Explain how Position is different from the Node (inner) class.
• Implement the core operations of List efficiently.
• Analyze the time/space efficiency of alternative implementation approaches (e.g. array vs linked structure).
• Explain the advantages of using sentinel node-based implementation.