In linked list implementation of a queue, the important condition for a queue to be empty is?
(a) FRONT is null
(b) REAR is null
(c) LINK is empty
(d) FRONT==REAR-1
This interesting question is from Queue using Linked List in portion Abstract Data Types of Data Structures & Algorithms I
I got this question during an interview.