Question: Why do the linked stack and queue implementations not include iterators, as in the linked list classes of Chapter 16? Are there cases in which
Why do the linked stack and queue implementations not include iterators, as in the linked list classes of Chapter 16? Are there cases in which a stack or queue might need to be traversed privately, even if access cannot be provided publicly? If so, should an iterator be used for these cases? Discuss any assumptions that have been made regarding sorting or searching with duplicate items in a list. How would the searching and sorting algorithms presented in this chapter handle duplicates?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
