Adding Circular Linked List In Data Structure. #1131

Issue Description:

Objective:
Add Circular Linked List to our list of recognized data structures.

Proposal:
Circular Linked List should be added as a core data structure due to its unique functionalities and widespread applicability.

Reasoning:

1. Circular Iteration: Enables seamless circular iteration, valuable for cyclic data processing needs.
2. Efficient Queue Implementation: Forms the foundation for circular queues, allowing for efficient enqueue and dequeue operations without element shifting.
3. Memory Management: Simplifies cyclic reference handling in memory management tasks like garbage collection.

Circular Linked Lists extend the capabilities of linear data structures, making them a valuable addition to our toolkit.