| | | | | |

List Complexity Requirements

  • Runtime Complexity <= O(1)
    • Default constructor
    • All insertion methods: PushFront(t), PushBack(t), and Insert(I,t)
    • All single-element removal methods: PopFront(), PopBack(), Remove(I,t)
    • All iterator support methods: Begin(), End(), rBegin(), rEnd()
    • All element access methods: Front(), Back()
    • Empty()
  • Runtime Complexity <= O(Size())
    • Copy Constructor
    • Assignment operator
    • Destructor
    • Size()
    • Clear()
    • Remove(t)

| | Top of Page | 8. A Generic List Class and Linked Lists - 7 of 19