Homework Clinic

Science Clinic => Computer Science => Programming and Graphic Design => Topic started by: xclash on Aug 30, 2020

Title: A double-ended queue, called a dequeue, is a queue that instead of having single links, in one ...
Post by: xclash on Aug 30, 2020

A double-ended queue, called a dequeue, is a queue that instead of having single links, in one direction, has a pair of links, one pointed in each direction.  Dequeues allows one to "push" and "pop" information at either end.  Is this ADT the same or different from a doubly linked list, as described in the textbook?

Title: A double-ended queue, called a dequeue, is a queue that instead of having single links, in one ...
Post by: popopong on Aug 30, 2020

This ADT is the same as a doubly linked list.  Each node contains a pair of links, one pointed in each direction, information can be added or deleted at either end of the list, nodes can store any kind of data.  This example illustrates the fact that data structures may go by many names, depending upon how one thinks about them.