🚀 LinkedList Visualization

# Linked List Overview

A linked list is a linear data structure consisting of a sequence of elements, where each element points to the next one in the sequence. Unlike arrays, linked lists do not have a fixed size and allow for dynamic memory allocation.

# Operations:

1. Insert
   - Description: Adds a new element to the end of the linked list.
   - Syntax: void insert(const T& value);

2. Display
   - Description: Prints the elements of the linked list to the console.
   - Syntax: void display();

# Properties:

1. Singly Linked List
   - Description: Each element in the list points to the next one, forming a unidirectional sequence.
   - Advantages: Efficient insertion and deletion at the beginning and end of the list.
   - Disadvantages: Inefficient random access and traversal requires sequential scanning.

2. Doubly Linked List
   - Description: Each element in the list points to both the next and the previous one, forming a bidirectional sequence.
   - Advantages: Supports efficient traversal in both directions and faster deletion of nodes.
   - Disadvantages: Requires more memory to store additional pointers.

3. Circular Linked List
   - Description: The last element in the list points back to the first one, forming a circular sequence.
   - Advantages: Allows for efficient traversal and operations that require looping through the list indefinitely.
   - Disadvantages: Insertion and deletion operations may be slightly more complex compared to linear linked lists.