List Wish List

• Insert an element into list [runtime complexity = Θ(1)]
• at the front
• at the back
• at a specified location
• Remove an element from list [Θ(1)]
• from front
• from back
• from a specified location
• Remove all items equal to a specified value [Θ(size)]
• Assignment operator [Θ(size)]
• Boolean operators ==() and !=() [O(size)]
• Proper type: constructors, destructor [Θ(size)]
• Generic class: class template
• Some convenient way to iterate through the list