DSA with GO

This repository contains a simple implementation of a DSA in Go.

Code Overview

Singly Linked List

• InsertAtStart - Insert a value at the beginning of the list.
• InsertAtEnd - Insert a value at the end of the list.
• Display - Display the entire linked list.
• IsEmpty - Check if the list is empty.
• DeleteByValue - Delete a node by its value.
• DeleteFromStart - Delete a node from the start of the list.
• DeleteFromEnd - Delete a node from the end of the list.
• Count - Count the node list.
• Reverse - Reverse the list.
• LinearSearch - Searching in the list with linear search.
• Middle - Find the middle of the list.
• RemoveDuplicate - Remove the duplicates from the unsorted list.
• Find - Find the value by index in list.
• IsCycle - Detect the cycle in list.

Doubly Linked List

• InsertAtStart - Insert a value at the beginning of the list.
• IsEmpty - Check if the list is empty.
• Count - Count the nodes in the list.
• Find - Find the value by index in list.