Skip to main content

Problem Solving with Algorithms and Data Structures using C++ The PreTeXt Interactive Edition

Section 4.9 Discussion Questions

  1. The alternative implementation of the Queue ADT is to use a list such that the rear of the queue is at the end of the list. What would this mean for Big-O performance?
    🔗
    🔗
  2. What is the result of carrying out both steps of the linked list add method in reverse order? What kind of reference results? What types of problems may result?
    🔗
    🔗
  3. Explain how the linked list remove method works when the item to be removed is in the last node.
    🔗
    🔗
  4. Explain how the remove method works when the item is in the only node in the linked list.
    🔗
    🔗
🔗
🔗
PrevTopNext