Does a queue crawl through memory in the direction of its head or its tail? Explain your answer.?

Answer 1

Queue is a data structure that doesnt allow you to traverse in reverse direction. You traverse only in forward direction. Hence it crawls from head to toe only.

Take following C Code:

struct Q {
int something; struct Q *next; };

here we store reference to next member only. So you cant traverse in backward direction.

But, in circular queues, you store the address of first node in last node's next pointer. There also, you traverse forward only - as you know what is next of a node -BUT not what is before a node.

Answer 2

It doesn't physically move through memory. There are pointers locating the data, which change as you manipulate the queue, but not in the way you are thinking. I think you have taken the concept of a queue a bit too literally!

Answer 3

tail

Answer 4

inspect your own memory.