What's the advantage of two pointers linked list implementation of Queue versus one pointer circular list
-
04-11-2019 - |
Question
Princeton Algorithms course shows the implementation of Queue using linked list and two pointers - head
and tail
. I've implemented the same functionality as a circular linked list using only one pointer tail
. I'm wondering what's the advantage of two pointers versus one in a circular list. It takes more space as I understand so why did they choose this implementation?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange