to create memory locations
we create queues using linked lists concept through pointers.
Is there any other technique to develop memory instead of above??
which one is more efficient approach if there is any other?
Is there any other technique to develop memory instead of above??
which one is more efficient approach if there is any other?
1) Queue is a container which support insertion on the one side and removal from the other side.
2) There is some well known container types which support effective insertion/deletion on both sides:
a) Double and single linked list
b) Deque
c) Circular buffer for size-limited queue.
2) There is some well known container types which support effective insertion/deletion on both sides:
a) Double and single linked list
b) Deque
c) Circular buffer for size-limited queue.
Topic archived. No new replies allowed.