The ternary search tree (TST) is a 3-way tree.It finds all keys having a given prefix, suffix, or infix. It even finds those keys that closely match a given pattern. You can easily search the tree for partial matches. In addition, you can implement near-match functions, which gives you the ability to suggest alternatives for [...]
-
Category Cloud
-
Reads
- 23,186 reads
-
God here
-
Top Posts
-
Follow me on twitter
- Try out Stanford University notes on machinelearning. cs229.stanford.edu/materials.html . Better than any book. #statistics #machinelearning #analyticsWhere the mind flows freely1 day ago
-
5
-
Blogroll
-
Seconds after Seconds
-
Random Colors
-
Flickr Photos



More Photos

