‹ Back to the paper
___________ is called a Self-Referential Data structure.
- aStack
- bCircular queue
- cLinked List
- dDouble ended queue - dequeue
Answer
Answer
AICorrect option: c
Answer: (c) Linked List.
A linked list node contains a reference (pointer) to another node of the same type, so the structure refers to itself - this is what makes it a self-referential data structure.
From ISC Computer Science - Competency Focused Practice Questions (CISCE, August 2024), question 20.