A __________is a self-referential data type because it contains a pointer or link to another data of thesame type.Select one:a.Stackb.Linked listc.Queued.Priority queue

To determine which option correctly completes the sentence, let's analyze each choice in the context of the definition provided:

1. Stack: A stack is a data structure that follows the Last In, First Out (LIFO) principle. It does not inherently contain pointers or links to other data of the same type. Instead, it typically uses an array or a linked list to manage its elements.

2. Linked list: A linked list is a data structure where each element (node) contains a value and a pointer (or link) to the next node in the sequence. This makes it a self-referential data type because each node points to another node of the same type.

3. Queue: A queue is a data structure that follows the First In, First Out (FIFO) principle. Like a stack, it can be implemented using an array or a linked list, but the concept of a queue itself does not inherently involve self-referential pointers.

4. Priority queue: A priority queue is a type of queue where each element has a priority, and elements are dequeued based on their priority. It can be implemented using various data structures like heaps, but it does not inherently involve self-referential pointers.

Given this analysis, the correct answer is:

b. Linked list

A linked list is a self-referential data type because it contains a pointer or link to another data of the same type.