Data structures in Go
- Heap
- Stack
- [-] (Needs callbacks per node) Trie
- Balanced Search Tree
I've made an effort to incorporate Go generics into the implementation. The user should be able to use any data type they want with these structures, given they provide a custom Compare function.