What's the advantage of two pointers linked list implementation of Queue versus one pointer circular list
-
04-11-2019 - |
문제
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?
올바른 솔루션이 없습니다
제휴하지 않습니다 cs.stackexchange