Concept:
A linked list is a collection of nodes where each node contains data and a pointer.
Step 1: Understand types.
• Linear list → last node points to NULL
• Circular list → last node points to first node ✔
Step 2: Evaluate condition.
Given:
• Last node connects to first node
This matches circular linked list.
Step 3: Conclusion.
\[
\boxed{(1)\ \text{Circular linked list}}
\]