Description: Dictionary tree set S by a number of words (English), given the string K, in the S to find the best match results K. The result of the best matching is defined as the string of the longest common prefix with K.
Cases: S={abc, bdef, Zhen, Zhao, abdd}, K1=zhao, K2=abdf, K3=cheng, and K1 the matching result is Zhao, K2 and the matching result is abdd, K3 and the matching result is epsilon (empty string).
To Search:
File list (Check if you may need any files):
Trie tree
.........\Debug
.........\.....\Trie tree.exe
.........\.....\Trie tree.ilk
.........\.....\Trie tree.pdb
.........\Trie tree
.........\Trie tree.sln
.........\Trie tree.suo
.........\.........\Debug
.........\.........\.....\CL.read.1.tlog
.........\.........\.....\CL.write.1.tlog
.........\.........\.....\link-cvtres.read.1.tlog
.........\.........\.....\link-cvtres.write.1.tlog
.........\.........\.....\link.20736-cvtres.read.1.tlog
.........\.........\.....\link.20736-cvtres.write.1.tlog
.........\.........\.....\link.20736.read.1.tlog
.........\.........\.....\link.20736.write.1.tlog
.........\.........\.....\link.read.1.tlog
.........\.........\.....\link.write.1.tlog
.........\.........\.....\mt.read.1.tlog
.........\.........\.....\mt.write.1.tlog
.........\.........\.....\rc.read.1.tlog
.........\.........\.....\rc.write.1.tlog
.........\.........\.....\Trie tree.exe.embed.manifest
.........\.........\.....\Trie tree.exe.embed.manifest.res
.........\.........\.....\Trie tree.exe.intermediate.manifest
.........\.........\.....\Trie tree.lastbuildstate
.........\.........\.....\Trie tree.log
.........\.........\.....\Trie tree.obj
.........\.........\.....\Trie tree_manifest.rc
.........\.........\.....\vc100.idb
.........\.........\.....\vc100.pdb
.........\.........\inputfile.txt
.........\.........\Trie tree.cpp
.........\.........\Trie tree.vcxproj
.........\.........\Trie tree.vcxproj.filters
.........\.........\Trie tree.vcxproj.user
trietree.docx
Download