In this repository, I will be implementing various data structures and algorithms using Go. This is a work in progress and I will be adding more implementations as I learn them.
All the implementations are tested using unit tests. You can find the tests in the *_test.go
files.
- Linked List (with thread-safe version)
- Stack (with thread-safe version)
- Queue (with thread-safe version)
- Binary Search Tree (with traversal and search)
- TODO Heap
- Graph (with BFS, DFS, topological sort, using both adjacency list and matrix techniques)
You can run the tests using the go test -v ./...
command.
$ go test -v ./...
This project is licensed under the MIT License - see the LICENSE file for details.