Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Im currently working on trying to understand Lists, Stacks, and Queues in C++. Im reviewing for my test and came across a question asking to "efficiently implement a queue class using a singly linked list, with no header or tail nodes."
Im kind of stumped, does anyone know how to do this?
Hint: Queues are often implemented using circular buffers. How would you create a circle with a singly linked list?