Data Structures and Algorithms

Learning Data Structures & Algorithms in Golang

Roadmap

Roadmap extracted from roadmap.sh

Basic data structures

1. Linked lists
2. Stacks
3. Queues and heaps
4. Hash tables

Sorting algorithms

5. Bubble sort
6. Merge sort
7. Insertion sort
8. Quick sort
9. Selection sort
10. Heap sort

Search algorithms

11. Linear search
12. Binary search

Tree data structures

13. Binary trees
14. Binary search trees
15. AVL trees
16. B-Trees
17. In-Order Traversal
18. Pre-Order Traversal
19. Post-Order Traversal
20. Breadth first search (BFS)
21. Depth first search (DFS)

Graph data structures

22. Directed graph
23. Undirected graph
24. Breadth first search (BFS)
25. Depth first search (DFS)
26. Dijkstra's algorithm
27. Bellman-Ford
28. Prim's algorithm
29. Kruskal's algorithm

Complex data structures

30. B/B+ trees
31. Skip list
32. ISAM
33. 2-3 trees

Indexing

34. Linear indexing
35. Tree-based indexing

Resources

• https://github.com/Workiva/go-datastructures