a radix tree (also radix trie or compact prefix tree) is a data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent.
// initialize tree
tree := Radix.TreeInit()
// add a word to the tree
tree.Addword("khairi")
// fill the tree with words from a csv file
err := tree.FillTree("data.csv")
// search for a word in the tree
found := tree.SearchTree("khairi")
// auto complete a given sub string
propNumber := tree.AutoComplete(input, false)
go get github.com/hammamikhairi/RadixTree
This project is a part of LFSA 88.
This package is licensed under MIT license. See LICENSE for details.