+1 vote
in Data Structures & Algorithms I by (110k points)
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.

1 Answer

+1 vote
by (412k points)
selected by
 
Best answer
Correct choice is (a) FRONT is null

Explanation: Because front represents the deleted nodes.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...