Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.
- Add, Get words, even space containing strings as words
- Clear and Save Dictionary (loading is done separately
- Finding is fast, max. longest word length iterations (restricted to 15)
- When compiling in Pascal (using crt_efd) colored text outputs
- for C++ and Pascal
Be the first to post a review of jamo Dictionary-tree!