A Go implementation of ternary search trees as described by Jon Bentley and Robert Sedgewick.
Ternary search trees are interesting data structures that provide a means of storing and accessing strings. They combine the time efficiency of digital tries with the space efficiency of binary search trees. Unlike a hash, they also maintain information about relative order.
To install ternarytree package, you need to install Go and set your Go workspace first.
- Download and install it:
$ go get -u github.com/mrogaski/ternarytree- Import it in your code:
import "github.com/mrogaski/ternarytree"-
Bentley, Jon and Sedgewick, Robert. "Ternary Search Trees". Dr. Dobb's Journal, April 1998. http://www.drdobbs.com/database/ternary-search-trees/184410528
-
Bentley, Jon and Sedgewick, Robert. "Fast Algorithms for Sorting and Searching Strings". Eighth Annual ACM-SIAM Symposium on Discrete Algorithms New Orleans, January, 1997. http://www.cs.princeton.edu/~rs/strings/