Write a link-based implementation of a queue that uses a circular linked chain t

Question

Write a link-based implementation of a queue that uses a circular linked chain to represent the items in the queue. You will need a single tail pointer. When you are done, compare your implementation to the one given in this chapter that uses a linear linked chain with two external pointers. Which implementation is easier to write? Which is easier to understand? Which is more ef?cient? Write a link-based implementation of a queue that uses a circular linked chain to represent the items in the queue. You will need a single tail pointer. When you are done, compare your implementation to the one given in this chapter that uses a linear linked chain with two external pointers. Which implementation is easier to write? Which is easier to understand? Which is more ef?cient?

Explanation / Answer

implementation with array is easy to code and understand but linked list implementation is efficient as we have no size limits # include # include # include int display_menu(); class circularqueue { int arr[10]; int front,rear; int size; public: circularqueue() { front=0; rear=0; size=10; } void display(); void enqueue(); void delete_element(); }; void circularqueue :: display() { cout

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.