Linked List Implementation in Go

This repository contains a simple implementation of;

• Singly LinkedList
• Circular LinkedList
• Doubly LinkedList in Go

Features

• Insertion: Add new nodes at the beginning, end, or at a specific position.
• Deletion: Remove nodes from the beginning, end, or by value.
• Search: Find a node containing a specific value.
• Traversal: Iterate over the linked list and print its contents.

How to Use

1. Clone the repository:

   git clone https://github.com/Ayobami6/linkedlist_implementation.git

2. Navigate to the project directory:

   cd linkedlist_implementation

3. Test Implementations

   make test

Examples

Refer to the main.go file for example usage of the linked list implementation.

Contributing

Contributions are welcome! Feel free to open issues or pull requests.

License

This project is licensed under the MIT License.