In computer science, a ternary search tree is a type of prefix tree where nodes are arranged as a binary search tree. Like other prefix trees, a ternary search tree can be used as an associative map structure with the ability for incremental string search. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. Common applications for ternary search trees include spell-checking and auto-completion.
Read more about Ternary Search Tree: Description, Uses
Famous quotes containing the words search and/or tree:
“So often has my judgment deceived me in my life, that I always suspect it, right or wrong,—at least I am seldom hot upon cold subjects. For all this, I reverence truth as much as any body; and ... if a man will but take me by the hand, and go quietly and search for it ... I’ll go to the world’s end with him:MBut I hate disputes.”
—Laurence Sterne (1713–1768)
“The windy springs and the blazing summers, one after another, had enriched and mellowed that flat tableland; all the human effort that had gone into it was coming back in long, sweeping lines of fertility. The changes seemed beautiful and harmonious to me; it was like watching the growth of a great man or of a great idea. I recognized every tree and sandbank and rugged draw. I found that I remembered the conformation of the land as one remembers the modelling of human faces.”
—Willa Cather (1873–1947)