- Linked List
- Doubly Linked List
- Queue (FIFO)
- Stack (LIFO)
- Hash Table + Collision Handling
- BST
- Heap
- AVL
- Graph
- Matrix
- Adjacency List
- Binary Search
- Linear Search
- Bubble Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Counting Sort
- Shell Sort
- Heap Sort
- Pre-order
- In-order
- Post-order
- Level-Order
- Tree Height
- Detecting Cycles
- Breadth First
- Depth First
- Dijkstra's algorithm (shortest path)
Create a new Go module (if you don't already have existing module):
go mod init <your-module>
Install the dsa-go
module:
go get -u github.com/bcdxn/dsa-go
go test -v -coverprofile cover.out ./...
go tool cover -html cover.out -o cover.html
open cover.html