This module provides a comprehensive collection of data structures and algorithms implemented in Go. It's designed for educational purposes, to help users understand and apply fundamental DSA concepts in the Go programming language.
- Linked Lists
- Singly Linked List
- Doubly Linked List
- Trees
- Binary Tree
- Tree Traversals (In-order, Pre-order, Post-order)
- Sorting Algorithms
- Quick Sort
- Merge Sort
- Bubble Sort
Clone the repository to your local machine:
git clone https://github.com/BryceWayne/dsa-module.git
Navigate to the cloned directory:
cd dsa-module
Import the required package from the module in your Go file. For example, to use the Binary Tree:
import "dsa-module/trees"This module includes example files for each data structure and algorithm to demonstrate usage. To run an example, navigate to the examples directory and execute the Go file. For example:
go run examples/binarytree_example.go
Contributions to this project are welcome. Please ensure to follow the Go coding standards and provide tests for new implementations.
This project is licensed under the MIT License - see the LICENSE file for details.
For any queries or contributions, please contact Bryce Wayne.