README
¶
collections
Summary
Basic data structures represent a great opportunity to learn a new langauge. These are some of the data structures that I have built to familiarize myself with the Go language
Usage
Even though these data structures have been built for my own learning purposes, if you find them useful, feel free to use them
Build
go get github.com/cosn/collections...
Test
go test github.com/cosn/collections...
Included structures
- B+ Tree (TODO)
- Binary Search Tree
- Bloom Filter (TODO)
- Queue
- Radix Tree (TODO)
- Red-Black Tree (TODO)
- [Set](http://en.wikipedia.org/wiki/Set_(computer_science)
- Splay Tree (TODO)
- Stack
- Ternary Search Tree
- Trie
Directories
¶
| Path | Synopsis |
|---|---|
|
Package bst implements an unbalanced binary search tree.
|
Package bst implements an unbalanced binary search tree. |
|
Package queue implements a queue.
|
Package queue implements a queue. |
|
Package set implements a hashset.
|
Package set implements a hashset. |
|
Package stack implements a stack.
|
Package stack implements a stack. |
|
Package trie implements a trie.
|
Package trie implements a trie. |
|
Package tst implements a ternary search tree.
|
Package tst implements a ternary search tree. |
Click to show internal directories.
Click to hide internal directories.